Year: 2021
Type: preprint
Abstract: Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $ϕ:E(H)\to [m]$ such that $e\in E(G_{ϕ(e)})$ for each $e\in 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/\log n)$.
Source: arXiv (Cornell University)
Institutions: University of Warwick, University College London
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: European Commission
OpenAlex ID: W4287081841