Constructive upper bounds for cycle-saturated graphs of minimum size

zbMath1099.05045MaRDI QIDQ5920622

Tomasz Łuczak, Ronald J. Gould, John R. Schmitt

Publication date: 30 August 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/126586

zbMATH Keywords

conjecture of Bollobás

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (4)

Saturation for the 3-uniform loose 3-cycle ⋮ Some results on the saturation number for unions of cliques ⋮ tK\(_p\)-saturated graphs of minimum size ⋮ On the number of edges in a minimum \(C_6\)-saturated graph

This page was built for publication: Constructive upper bounds for cycle-saturated graphs of minimum size