The Library
Transversal factors and spanning trees
Tools
Tools
Tools
Montgomery, Richard, Müyesser, Alp and Pehova, Yanitsa (2022) Transversal factors and spanning trees. Advances in Combinatorics . doi:10.19086/aic.2022.3
|
PDF
WRAP-Transversal-factors-and-spanning-trees-Montgomery-22.pdf - Published Version - Requires a PDF viewer. Available under License Creative Commons Attribution 4.0. Download (412Kb) | Preview |
Official URL: http://dx.doi.org/10.19086/aic.2022.3
Abstract
Given a collection of graphs G = (G1,...,Gm) with the same vertex set, an m-edge graph H ⊂ ∪i∈[m]Gi is a transversal if there is a bijection φ : E(H) → [m] such that e ∈ E(Gφ(e)) for each e ∈ E(H). We give asymptotically-tight minimum degree conditions for a graph collection on an n-vertex set to have a transversal which is a copy of a graph H, when H is an n-vertex graph which is an F-factor or a tree with maximum degree o(n/logn).
| Item Type: | Journal Article | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | |||||||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | |||||||||
| Library of Congress Subject Headings (LCSH): | Spanning trees (Graph theory), Graph theory, Extremal problems (Mathematics) | |||||||||
| Journal or Publication Title: | Advances in Combinatorics | |||||||||
| Publisher: | Alliance of Diamond Open Access | |||||||||
| ISSN: | 2517-5599 | |||||||||
| Official Date: | 16 May 2022 | |||||||||
| Dates: |
|
|||||||||
| Number of Pages: | 25 | |||||||||
| DOI: | 10.19086/aic.2022.3 | |||||||||
| Status: | Peer Reviewed | |||||||||
| Publication Status: | Published | |||||||||
| Access rights to Published version: | Open Access | |||||||||
| RIOXX Funder/Project Grant: |
|
|||||||||
| Open Access Version: |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
