On the Structure of Edge Graphs II

DOI10.1112/JLMS/S2-12.2.219zbMath0318.05110OpenAlexW2898832064WikidataQ105998041 ScholiaQ105998041MaRDI QIDQ4079632

Béla Bollobás, Miklós Simmonovits

Publication date: 1976

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-12.2.219

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (18)

Additive combinatorics and graph theory ⋮ An extension of the Erdős-Stone theorem ⋮ On the density of a graph and its blowup ⋮ Turán-Ramsey problems ⋮ Ramsey non-goodness involving books ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On vertex-induced weighted Turán problems ⋮ Packing of graphs with small product of sizes ⋮ A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs ⋮ On complete subgraphs of \(r\)-chromatic graphs ⋮ Arithmetic progressions, different regularity lemmas and removal lemmas ⋮ Stability of the path-path Ramsey number ⋮ Supersaturated graphs and hypergraphs ⋮ Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem ⋮ Tight bounds for powers of Hamilton cycles in tournaments ⋮ The maximum number of disjoint pairs in a family of subsets ⋮ Almost-spanning subgraphs with bounded degree in dense graphs ⋮ Complete Partite subgraphs in dense hypergraphs

This page was built for publication: On the Structure of Edge Graphs II