MinimumK2, 3-Saturated Graphs

DOI10.1002/JGT.21767zbMATH Open1296.05097arXiv1012.4152OpenAlexW1788746465MaRDI QIDQ5495889FDOQ5495889

Authors: Ya-Chen Chen 

Publication date: 7 August 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Abstract: A graph is K_{2,3}-saturated if it has no subgraph isomorphic to K_{2,3}, but does contain a K_{2,3} after the addition of any new edge. We prove that the minimum number of edges in a K_{2,3}-saturated graph on n >= 5 vertices is sat(n, K_{2,3}) = 2n - 3.

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

Recommendations

• A note on minimum \(K_{2,3}\)-saturated graphs
• Minimum \(C_k\)-saturated graphs
• Minimum degree and the minimum size of \(K_2^t\)-saturated graphs
• Minimizing the number of edges in (P_k ∪ K₃)-saturated connected graphs
• Minimum \(t P_3\)-saturation graphs
• \(P_m\)-saturated graphs with minimum size
• A survey of minimum saturated graphs
• Minimizing the number of edges in \(K_{(s,t)}\)-saturated bipartite graphs
• Triangles in \(K_s\)-saturated graphs with minimum degree \(t\)
• tK\(_p\)-saturated graphs of minimum size

zbMATH Keywords

extremal graphsforbidden subgraphs\(K_{23}\)-saturated graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35)

Cites Work

• Saturated \(r\)-uniform hypergraphs
• Saturated graphs with minimal number of edges
• A survey of minimum saturated graphs
• A Problem in Graph Theory
• On generalized graphs
• All minimum \(C_{5}\)-saturated graphs
• Minimum C₅‐saturated graphs
• Cycle-saturated graphs with minimum number of edges
• The Minimum Size of Saturated Hypergraphs
• The saturation function of complete partite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cycle-saturated graphs of minimum size
• Minimum degree and the minimum size of \(K_2^t\)-saturated graphs
• Saturation numbers of books
• Constructive upper bounds for cycle-saturated graphs of minimum size
• Asymptotic results on saturated graphs
• \(C_{3}\) saturated graphs

Cited In (19)

• The saturation number of \(K_{3,3}\)
• Saturation numbers for linear forests $P_6 + tP_2$
• Triangles in \(K_s\)-saturated graphs with minimum degree \(t\)
• Minimum \(t P_3\)-saturation graphs
• A note on minimum \(K_{2,3}\)-saturated graphs
• Linear saturation numbers of Berge-\(C_3\) and Berge-\(C_4\)
• Onk-saturated graphs with restrictions on the degrees
• Minimum degree and the minimum size of \(K_2^t\)-saturated graphs
• On \((\mathrm{K}_t-e)\)-saturated graphs
• The partite saturation number of spider
• Saturation in Kneser graphs
• \(K_{s,t}\)-saturated bipartite graphs
• Title not available (Why is that?)
• Saturated graphs of prescribed minimum degree
• Title not available (Why is that?)
• Minimizing the number of edges in \(K_{(s,t)}\)-saturated bipartite graphs
• Minimizing the number of edges in (P_k ∪ K₃)-saturated connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: MinimumK_{2, 3}-Saturated Graphs

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