A note on minimum K₂,3-saturated graphs

MaRDI QIDQ5449159zbMATH OpenFDO

Authors Oleg Pikhurko, John Schmitt

Publication date 11 March 2008

zbMATH Keywords

\(K_{2,3}\)-saturated treesasymptotic behavior

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• MinimumK_{2, 3}-Saturated Graphs
• Minimum degree and the minimum size of \(K_2^t\)-saturated graphs
• Graph saturation in multipartite graphs
• \(K_{s,t}\)-saturated bipartite graphs
• Minimum \(t P_3\)-saturation graphs

Cited in

(11)

• tK\(_p\)-saturated graphs of minimum size
• Minimum \(t P_3\)-saturation graphs
• Saturating Sperner families
• A note on minimum graphs with girth pair (4, 2l + 1)
• MinimumK_{2, 3}-Saturated Graphs
• The saturation number of \(K_{3,3}\)
• Some results on the saturation number for unions of cliques
• Saturation numbers of joins of graphs
• The saturation number for unions of four cliques
• Minimum saturated graphs for unions of cliques
• The game of \(\mathcal F\)-saturator

This page was built for publication: A note on minimum \(K_{2,3}\)-saturated graphs

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