Asymptotic solution of a Turán-type problem

DOI10.1007/BF01787573zbMath0724.05070OpenAlexW2045914539MaRDI QIDQ2276984

Peter Frankl

Publication date: 1990

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

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

zbMATH Keywords

extremal set problemuniform hypergraphextremal hypergraphsymmetric differencemaximum number of edgesexcluded subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items

2-Cancellative Hypergraphs and Codes, Co-degree density of hypergraphs, A new generalization of Mantel's theorem to \(k\)-graphs, Extremal Problems for Hypergraph Blowups of Trees, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, High dimensional Hoffman bound and applications in extremal combinatorics, Counting substructures. II: Hypergraphs, Constructions of non-principal families in extremal hypergraph theory, On \(k\)-uniform random hypergraphs without generalized fans, Asymptotic solution of the Turán problem for some hypergraphs, A hypergraph extension of Turán's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Union-free hypergraphs and probability theory
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Three-graphs without two triples whose symmetric difference is contained in a third
• On extremal problems of graphs and generalized graphs
• A new generalization of the Erdős-Ko-Rado theorem