The fine structure of octahedron-free graphs

DOI10.1016/j.jctb.2010.11.001zbMath1239.05098OpenAlexW2047564915MaRDI QIDQ631642

József Balogh, Béla Bollobás, Miklós Simmonovits

Publication date: 14 March 2011

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2010.11.001

zbMATH Keywords

extremal graphsgraph countingstructure of \(H\)-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial inequalities (05A20)

Related Items

The number of \(C_{2\ell}\)-free graphs, Almost all string graphs are intersection graphs of plane convex sets, Balanced supersaturation for some degenerate hypergraphs, The structure of almost all graphs in a hereditary property, Almost all triple systems with independent neighborhoods are semi-bipartite, Almost all triangle-free triple systems are tripartite, The number of \(K_{m,m}\)-free graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On the structure of oriented graphs and digraphs with forbidden tournaments or cycles, The typical structure of sparse $K_{r+1}$-free graphs, DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS, Asymptotic probabilities of extension properties and random \(l\)-colourable structures, A Limit Law of Almost l-partite Graphs, Almost all string graphs are intersection graphs of plane convex sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of almost all graphs in a hereditary property
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On the number of graphs without 4-cycles
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• Random Ramsey graphs for the four-cycle
• The number of graphs without forbidden subgraphs
• Compactness results in extremal graph theory
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• On the existence of triangulated spheres in 3-graphs, and related problems
• Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
• Excluding induced subgraphs: Critical graphs
• The typical structure of graphs without given excluded subgraphs
• Extremal graphs with bounded densities of small subgraphs
• The number of K _s,t -free graphs
• An extremal graph problem
• Extensions of Turán's theorem on graphs
• On a problem of K. Zarankiewicz