On the Structure of Edge Graphs II
From MaRDI portal
Publication:4079632
DOI10.1112/JLMS/S2-12.2.219zbMATH Open0318.05110OpenAlexW2898832064WikidataQ105998041 ScholiaQ105998041MaRDI QIDQ4079632FDOQ4079632
Authors: Béla Bollobás, Miklós Simonovits, P. Erdős 
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
Recommendations
Cited In (22)
- Packing of graphs with small product of sizes
- Generalization of Erdős and Rousseau's counting lemma in graph theory
- On vertex-induced weighted Turán problems
- A neighborhood condition which implies the existence of a complete multipartite subgraph
- Almost-spanning subgraphs with bounded degree in dense graphs
- Title not available (Why is that?)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- An extension of the Erdős-Stone theorem
- On the Structure of Edge Graphs
- Tight bounds for powers of Hamilton cycles in tournaments
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
- On the density of a graph and its blowup
- Complete partite subgraphs in dense hypergraphs
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Supersaturated graphs and hypergraphs
- Stability of the path-path Ramsey number
- Ramsey non-goodness involving books
- On complete subgraphs of \(r\)-chromatic graphs
- The maximum number of disjoint pairs in a family of subsets
- Turán-Ramsey problems
- Additive combinatorics and graph theory
This page was built for publication: On the Structure of Edge Graphs II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079632)
