The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

DOI10.1007/BF01788085zbMath0593.05038OpenAlexW2093276208WikidataQ105583451 ScholiaQ105583451MaRDI QIDQ1076037

Peter Frankl, Paul Erdős, Vojtěch Rödl

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788085

zbMATH Keywords

uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items

Structured Codes of Graphs, Separating Hash Families: A Johnson-type bound and New Constructions, Generalized Turán problems for double stars, Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity, On supersaturation and stability for generalized Turán problems, Generalized Turán results for intersecting cliques, On a generalized Erdős–Rademacher problem, On sufficient conditions for spanning structures in dense graphs, Balanced supersaturation for some degenerate hypergraphs, Counting hypergraphs with large girth, Minimum degree and the graph removal lemma, Almost every matroid has an $M(K_4)$- or a $\mathcal{W}^3$-minor, Improved lower bounds for multiplicative square-free sequences, Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points, Local-vs-global combinatorics, Simple Containers for Simple Hypergraphs, Asymptotic Structure of Graphs with the Minimum Number of Triangles, The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours, Uniformity thresholds for the asymptotic size of extremal Berge-$F$-free hypergraphs, The structure and the number of $P_7$-free bipartite graphs, Measures on monotone properties of graphs, Uniformity thresholds for the asymptotic size of extremal Berge-$F$-free hypergraphs, The structure and the number of $P_7$-free bipartite graphs, Deciding the Bell Number for Hereditary Graph Properties, The Induced Removal Lemma in Sparse Graphs, Triple systems with no three triples spanning at most five points, Independent sets in hypergraphs, The regularity method for graphs with few 4‐cycles, 2-Cancellative Hypergraphs and Codes, Excluding induced subgraphs: quadrilaterals, The number of $C_{2\ell}$-free graphs, On subsets of abelian groups with no 3-term arithmetic progression, THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS, The number of hypergraphs without linear cycles, Extremal problems on set systems, Counting H-free orientations of graphs, A note on the uniformity threshold for Berge hypergraphs, Perfect Graphs of Fixed Density: Counting and Homogeneous Sets, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, A variant of the hypergraph removal lemma, On Ramsey numbers of uniform hypergraphs with given maximum degree, Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$, Mantel's theorem for random graphs, SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY, New applications of the polynomial method: The cap set conjecture and beyond, Tournaments, 4-uniform hypergraphs, and an exact extremal result, Counting $r$-graphs without forbidden configurations, Color the cycles, Uniform hypergraphs containing no grids, Bounds for graph regularity and removal lemmas, Shattering, graph orientations, and connectivity, Classes of graphs without star forests and related graphs, Almost all string graphs are intersection graphs of plane convex sets, Locally bounded coverings and factorial properties of graphs, Hypergraphs with many Kneser colorings, The fine structure of octahedron-free graphs, The structure of almost all graphs in a hereditary property, Shadows of ordered graphs, Almost all triple systems with independent neighborhoods are semi-bipartite, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, A new proof of the graph removal lemma, Maximal antichains of minimum size, Some exact results of the generalized Turán numbers for paths, The maximum spectral radius of graphs without friendship subgraphs, Almost all triangle-free triple systems are tripartite, Sparse Hypergraphs with Applications to Coding Theory, A short nonalgorithmic proof of the containers theorem for hypergraphs, The number of $K_{m,m}$-free graphs, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Sparse hypergraphs: new bounds and constructions, A counterexample to sparse removal, Two notions of unit distance graphs, On the KŁR conjecture in random graphs, On the structure of graphs with low obstacle number, The domination number of the graph defined by two levels of the $n$-cube. II, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Unexpected upper bounds on the complexity of some communication games, On Colourings of Hypergraphs Without Monochromatic Fano Planes, A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity, Hypergraph containers, Induced Turán Numbers, An analytic approach to sparse hypergraphs: hypergraph removal, On the structure of oriented graphs and digraphs with forbidden tournaments or cycles, The typical structure of graphs with no large cliques, Tight cycles and regular slices in dense hypergraphs, Excluding induced subgraphs. II: Extremal graphs, Tiling tripartite graphs with 3-colorable graphs: the extreme case, On the maximum running time in graph bootstrap percolation, A removal lemma for systems of linear equations over finite fields, The uniformity lemma for hypergraphs, Definability of Combinatorial Functions and Their Linear Recurrence Relations, Unnamed Item, The number of graphs with large forbidden subgraphs, Generalizations of the removal lemma, Graphs with Large Obstacle Numbers, Regularity properties for triple systems, Proof of the Brown–Erdős–Sós conjecture in groups, Hereditary properties of hypergraphs, DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS, Relative Turán numbers for hypergraph cycles, On the typical structure of graphs in a monotone property, Hypergraphs without exponents, Asymptotic Structure for the Clique Density Theorem, An efficient container lemma, Triangle-free subgraphs of hypergraphs, A note on stability for maximal $F$-free graphs, The typical structure of graphs without given excluded subgraphs, Degenerate Turán densities of sparse hypergraphs, UPPER BOUND THEOREM FOR ODD‐DIMENSIONAL FLAG TRIANGULATIONS OF MANIFOLDS, Boundary Properties of Factorial Classes of Graphs, The number of graphs without forbidden subgraphs, A note on counting orientations, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Estimating parameters associated with monotone properties, On the weight of Berge-$F$-free hypergraphs, On a Turán-type hypergraph problem of Brown, Erdős and T. Sós, On the domination number of a graph defined by containment, A tight bound for hypergraph regularity, Induced subgraphs of given sizes, The speed of hereditary properties of graphs, A new bound for the Brown-Erdős-Sós problem, Turán numbers and batch codes, Hereditary classes of graphs: a parametric approach, Counting independent sets in graphs, Every Monotone 3-Graph Property is Testable, A linear hypergraph extension of Turán's theorem, The Erdős-Ko-Rado theorem for small families, Almost all string graphs are intersection graphs of plane convex sets

Cites Work