Asymptotic growth of sparse saturated structures is locally determined

DOI10.1016/0012-365X(92)90692-9zbMath0767.05064MaRDI QIDQ1201274

Zsolt Tuza

Publication date: 17 January 1993

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

zbMATH Keywords

growthhypergraphTurán numberlocal densitylocal sparseness

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (10)

On saturation of Berge hypergraphs ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Weak saturation stability ⋮ Weak saturation number of a complete bipartite graph ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ Weak saturation numbers of complete bipartite graphs in the clique ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Graph cover-saturation ⋮ Partite Saturation Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extremal problem for sets with applications to graph theory
• Asymptotic results on saturated graphs
• Saturated \(r\)-uniform hypergraphs
• Saturated graphs with minimal number of edges
• A Problem in Graph Theory
• On generalized graphs

This page was built for publication: Asymptotic growth of sparse saturated structures is locally determined