The number of K s,t -free graphs
From MaRDI portal
Publication:5392190
DOI10.1112/jlms/jdq086zbMath1227.05170OpenAlexW2040218501WikidataQ105584981 ScholiaQ105584981MaRDI QIDQ5392190
József Balogh, Wojciech Samotij
Publication date: 8 April 2011
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/jdq086
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Extremal combinatorics (05D99)
Related Items (23)
The number of \(C_{2\ell}\)-free graphs ⋮ The number of hypergraphs without linear cycles ⋮ Counting H-free orientations of graphs ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ Applications of graph containers in the Boolean lattice ⋮ Balanced supersaturation for some degenerate hypergraphs ⋮ Counting hypergraphs with large girth ⋮ The fine structure of octahedron-free graphs ⋮ The structure of almost all graphs in a hereditary property ⋮ 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 ⋮ Hypergraph containers ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ Counting configuration-free sets in groups ⋮ 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 ⋮ DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS ⋮ Triangle-free subgraphs of hypergraphs ⋮ Estimating parameters associated with monotone properties ⋮ Independent sets in hypergraphs ⋮ Counting independent sets in graphs
This page was built for publication: The number of K s,t -free graphs
