Minimum degree and the minimum size of \(K_2^t\)-saturated graphs

DOI10.1016/j.disc.2006.08.004zbMath1116.05040OpenAlexW2157319413MaRDI QIDQ870972

John R. Schmitt, Ronald J. Gould

Publication date: 15 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.08.004

zbMATH Keywords

complete multipartite graphminimize size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

The saturation number of \(K_{3,3}\) ⋮ MinimumK_{2, 3}-Saturated Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimalk-saturated and color critical graphs of prescribed minimum degree
• Saturated graphs with minimal number of edges
• The Minimum Size of Saturated Hypergraphs
• A Problem in Graph Theory

This page was built for publication: Minimum degree and the minimum size of \(K_2^t\)-saturated graphs