On the number of H-free hypergraphs
From MaRDI portal
Publication:6855055
Cites work
- A survey of Turán problems for expansions
- An extremal problem for random graphs and the number of graphs with large even-girth
- Balanced supersaturation and Turán numbers in random graphs
- Combinatorial theorems in sparse random sets
- Exact solution of some Turán-type problems
- Exact solution of the hypergraph Turán problem for k-uniform linear paths
- Extremal results for random discrete structures
- Extremal results in random graphs
- Forbidding just one intersection
- scientific article; zbMATH DE number 5130822 (Why is no real title available?)
- scientific article; zbMATH DE number 3900799 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3557819 (Why is no real title available?)
- Hypergraph containers
- Hypergraph Turán numbers of linear cycles
- Independent sets in hypergraphs
- Intersecting families of discrete structures are typically trivial
- Intersection Properties of Systems of Finite Sets
- Linear trees in uniform hypergraphs
- On coloring graphs to maximize the proportion of multicolored k-edges
- On extremal problems of graphs and generalized graphs
- On families of finite sets no two of which intersect in a singleton
- On finite set-systems whose every intersection is a kernel of a star
- On the number of edges of quadrilateral-free graphs
- On the number of graphs without 4-cycles
- Supersaturated graphs and hypergraphs
- Supersaturated sparse graphs and hypergraphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The number of \(C_{2\ell}\)-free graphs
- The number of \(K_{m,m}\)-free graphs
- The number of \(K_{s,t}\)-free graphs
- The number of hypergraphs without linear cycles
- The number of triple systems without even cycles
- Turán problems and shadows. I: Paths and cycles
- Turán problems and shadows. II: Trees
- Turán theorems for even cycles in random hypergraph
- Turán's extremal problem in random graphs: Forbidding even cycles
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
This page was built for publication: On the number of \(\mathcal{H}\)-free hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855055)
