Minimum degree and the minimum size of K₂^t-saturated graphs

DOI10.1016/J.DISC.2006.08.004zbMATH Open1116.05040OpenAlexW2157319413MaRDI QIDQ870972FDOQ870972

Authors: Ronald Gould, John Schmitt 

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

Recommendations

• Saturated graphs of prescribed minimum degree
• MinimumK_{2, 3}-Saturated Graphs
• Triangles in \(K_s\)-saturated graphs with minimum degree \(t\)
• Graph saturation in multipartite graphs
• \(K_{s,t}\)-saturated bipartite graphs

zbMATH Keywords

complete multipartite graphminimize size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Saturated graphs with minimal number of edges
• Title not available (Why is that?)
• A Problem in Graph Theory
• Title not available (Why is that?)
• The Minimum Size of Saturated Hypergraphs
• Title not available (Why is that?)
• Minimalk-saturated and color critical graphs of prescribed minimum degree
• Title not available (Why is that?)

Cited In (7)

• The saturation number of \(K_{3,3}\)
• A note on minimum \(K_{2,3}\)-saturated graphs
• On \(K_{s,t}\)-minors in graphs with given average degree
• Onk-saturated graphs with restrictions on the degrees
• Min-max and max-min graph saturation parameters
• Constructive upper bounds for cycle-saturated graphs of minimum size
• MinimumK_{2, 3}-Saturated Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870972)