Saturated \(r\)-uniform hypergraphs

DOI10.1016/0012-365X(91)90035-ZzbMath0766.05060OpenAlexW2062088180WikidataQ127526455 ScholiaQ127526455MaRDI QIDQ1184855

Paul Erdős, Zsolt Tuza, Zoltan Fueredi

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90035-z

zbMATH Keywords

hypergraphsTurán's problemminimum number

Mathematics Subject Classification ID

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

Related Items

Weak saturation number for multiple copies of the complete graph with a star removed ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Saturating Sperner families ⋮ Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\) ⋮ On saturated \(k\)-Sperner systems ⋮ Weak saturation stability ⋮ Weak saturation numbers of complete bipartite graphs in the clique ⋮ All minimum C5-saturated graphs ⋮ Small maximally disjoint union-free families ⋮ Asymptotic growth of sparse saturated structures is locally determined ⋮ Weak saturation numbers for multiple copies ⋮ Minimum C₅‐saturated graphs ⋮ MinimumK_{2, 3}-Saturated Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• An extremal problem for two families of sets
• Saturated graphs with minimal number of edges
• A Problem in Graph Theory
• On generalized graphs