Spanning subdivisions in Dirac graphs
- 20 October 2023
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 33 (1) , 121-128
Abstract
We show that for every -regular graph.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Dependent random choiceRandom Structures & Algorithms, 2010
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type QuestionsCombinatorics, Probability and Computing, 2003
- Proof of a tiling conjecture of KomlósRandom Structures & Algorithms, 2003
- Tiling Turán TheoremsCombinatorica, 2000
- On the P sa-Seymour conjectureJournal of Graph Theory, 1998
- Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete SubgraphsEuropean Journal of Combinatorics, 1998
- Proof of the Seymour conjecture for large graphsAnnals of Combinatorics, 1998
- Subdivisions of graphs with large minimum degreeJournal of Graph Theory, 1984
- Homomorphieeigenschaften und mittlere Kantendichte von GraphenMathematische Annalen, 1967
- On chromatic number of graphs and set-systemsActa Mathematica Hungarica, 1966