Minimum degree conditions for large subgraphs
From MaRDI portal
Publication:2851441
DOI10.1016/j.endm.2009.07.013zbMath1273.05112OpenAlexW2058358278MaRDI QIDQ2851441
No author found.
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.013
Cites Work
- Unnamed Item
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Proof of the Seymour conjecture for large graphs
- Tiling Turán theorems
- The minimum degree threshold for perfect graph packings
- On the square of a Hamiltonian cycle in dense graphs
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- On the structure of linear graphs
This page was built for publication: Minimum degree conditions for large subgraphs