The number of \(K_{m,m}\)-free graphs

DOI10.1007/s00493-011-2610-yzbMath1249.05190OpenAlexW988817357MaRDI QIDQ653990

Wojciech Samotij, József Balogh

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2610-y

zbMATH Keywords

\(K_{m,m}\)-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Asymptotic enumeration (05A16) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (11)

The number of \(C_{2\ell}\)-free graphs ⋮ The number of hypergraphs without linear cycles ⋮ Counting H-free orientations of graphs ⋮ Balanced supersaturation for some degenerate hypergraphs ⋮ The structure of almost all graphs in a hereditary property ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers ⋮ Counting sum-free sets in abelian groups ⋮ Counting Gallai 3-colorings of complete graphs ⋮ Independent sets in hypergraphs ⋮ Counting independent sets in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• The fine structure of octahedron-free graphs
• 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
• An extremal problem for random graphs and the number of graphs with large even-girth
• Random Ramsey graphs for the four-cycle
• The number of graphs without forbidden subgraphs
• Turán's extremal problem in random graphs: Forbidding even cycles
• Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
• The typical structure of graphs without given excluded subgraphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• An Upper Bound on Zarankiewicz' Problem
• The number of K _s,t -free graphs
• Probability and Computing
• On Graphs that do not Contain a Thomsen Graph
• On the structure of linear graphs
• Asymptotic enumeration, global structure, and constrained evolution

This page was built for publication: The number of \(K_{m,m}\)-free graphs