On the Structure of Edge Graphs

DOI10.1112/BLMS/5.3.317zbMATH Open0277.05135OpenAlexW2330712042MaRDI QIDQ4401980FDOQ4401980

Authors: Béla Bollobás, P. Erdős 

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1112/blms/5.3.317

Recommendations

• On the Structure of Edge Graphs II
• On the number of edge disjoint cliques in graphs of given size
• On a Ramsey type theorem
• An extremal problem onKr-free graphs
• On extremal problems of graphs and generalized graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited In (33)

• Graph topologies induced by edge lengths
• On a Ramsey type theorem
• On finite simple groups and Kneser graphs.
• On vertex-induced weighted Turán problems
• Title not available (Why is that?)
• Almost-spanning subgraphs with bounded degree in dense graphs
• Some extremal problems for hereditary properties of graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• An extension of the Erdős-Stone theorem
• On the Structure of Edge Graphs II
• Graph Invariants in the Edge Model
• 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
• Ramsey numbers of a fixed odd-cycle and generalized books and fans
• Packings of graphs and applications to computational complexity
• Two multicolor Ramsey numbers involving bipartite graphs
• On the density of a graph and its blowup
• Turán numbers of several bipartite graphs
• On the structure of clique-free graphs
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• A spectral Erdős-Stone-Bollobás theorem
• Universal and unavoidable graphs
• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• On the Edge-Expansion of Graphs
• Ramsey numbers of fans and large books
• The Structure of the Heawood Graph
• Ramsey non-goodness involving books
• On complete subgraphs of \(r\)-chromatic graphs
• Measures on monotone properties of graphs
• On graphs for which large books are Ramsey good
• Title not available (Why is that?)
• Turán-Ramsey problems
• The speed of hereditary properties of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401980)