Spanning subdivisions in Dirac graphs
Preprint
Abstract
We show that for every $n\in\mathbb N$ and $\log n\le d\le n$, if a graph $G$ has $N=\Theta(dn)$ vertices and minimum degree $(1+o(1))\frac{N}{2}$, then it contains a spanning subdivision of every $n$-vertex $d$-regular graph.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Sufficient conditions for perfect mixed tilingsJournal of Combinatorial Theory, Series B, 2024
- Balanced Subdivisions of Cliques in GraphsCombinatorica, 2023
- Disjoint isomorphic balanced clique subdivisionsJournal of Combinatorial Theory, Series B, 2023
- Spanning trees in dense directed graphsJournal of Combinatorial Theory, Series B, 2022
- Dependent random choiceRandom Structures & Algorithms, 2010
- Embedding large subgraphs into dense graphs2009
- The minimum degree threshold for perfect graph packingsCombinatorica, 2009
- On the P sa-Seymour conjectureJournal of Graph Theory, 1998
- Proof of the Seymour conjecture for large graphsAnnals of Combinatorics, 1998
- Homomorphieeigenschaften und mittlere Kantendichte von GraphenMathematische Annalen, 1967