A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
From MaRDI portal
Publication:697080
DOI10.1006/EUJC.2002.0575zbMATH Open1003.05057OpenAlexW2006065759MaRDI QIDQ697080FDOQ697080
Authors: Yoshiyas Ishigami
Publication date: 12 September 2002
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2002.0575
Recommendations
Cites Work
- Almost \(H\)-factors in dense graphs
- Tiling Turán theorems
- \(H\)-factors in dense graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the maximal number of independent circuits in a graph
- On the structure of linear graphs
- Proof of the Alon-Yuster conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- Blow-up lemma
- On the Structure of Edge Graphs
- Title not available (Why is that?)
- Variants of the Hajnal-Szemer�di Theorem
- An extension of the Erdős-Stone theorem
- On the Structure of Edge Graphs II
- On the Erdös-Stone Theorem
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697080)