On the number of \(K_4\)-saturating edges

DOI10.1016/j.jctb.2014.06.008zbMath1301.05182arXiv1312.5248OpenAlexW2036909087MaRDI QIDQ462935

József Balogh, Hong Liu

Publication date: 22 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.5248

zbMATH Keywords

extremal number\(K_4\)Erdős-Tuza conjecturesaturating edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Structure and supersaturation for intersecting families ⋮ The minimum number of clique-saturating edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear algebra and bootstrap percolation
• Counting substructures. II: Hypergraphs
• On a theorem of Rademacher-Turán
• Counting substructures. I: Color critical graphs
• Graph bootstrap percolation
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman

This page was built for publication: On the number of \(K_4\)-saturating edges