Minimum K2, 3-Saturated Graphs
JOURNAL OF GRAPH THEORY（2014）
摘要
A graph is K2, 3-saturated if it has no subgraph isomorphic to K2, 3, but does contain a K2, 3 after the addition of any new edge. We prove that the minimum number of edges in a K2, 3-saturated graph on n5 vertices is sat(n,K2,3)=2n-3.
更多查看译文
关键词
extremal graphs,forbidden subgraphs,K2,3-saturated graphs,1991 Mathematics Subject Classification: 05C35
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要