Almost-spanning subgraphs with bounded degree in dense graphs
From MaRDI portal
Publication:1864574
DOI10.1006/eujc.2002.0576zbMath1017.05053OpenAlexW2077900128MaRDI QIDQ1864574
Publication date: 18 March 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2002.0576
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
- The Ramsey number of a graph with bounded maximum degree
- On circuits in graphs
- Almost \(H\)-factors in dense graphs
- Proof of the Seymour conjecture for large graphs
- An extension of the Erdős-Stone theorem
- Blow-up lemma
- How tight is the Bollobás-Komlós conjecture?
- Tiling Turán theorems
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- Graph decompositions without isolated vertices
- \(H\)-factors in dense graphs
- Graph decompositions and \(D_3\)-paths with a prescribed endvertex
- On the Erdös-Stone Theorem
- On the Structure of Edge Graphs II
- A homology theory for spanning tress of a graph
- [https://portal.mardi4nfdi.de/wiki/Publication:4242796 An El-Zah�r type condition ensuring path-factors]
- The Blow-up Lemma
- On decomposition of triangle-free graphs under degree constraints
- On the Structure of Edge Graphs
- Proof of a Packing Conjecture of Bollobás
- On the square of a Hamiltonian cycle in dense graphs
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Proof of the Alon-Yuster conjecture
- Holes in graphs
This page was built for publication: Almost-spanning subgraphs with bounded degree in dense graphs
