Minimum K_2,3-saturated Graphs

Ya-Chen Chen

Minimum K_2,3-saturated Graphs

Combinatorics 2014-07-01 v9

Authors: Ya-Chen Chen

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.

Keywords

graph pebbling graph theory graph cycles

Cite

@article{arxiv.1012.4152,
  title  = {Minimum K_2,3-saturated Graphs},
  author = {Ya-Chen Chen},
  journal= {arXiv preprint arXiv:1012.4152},
  year   = {2014}
}

Comments

12 pages; improve writing, add more detailed explanation, minor corrections

Related papers

View all related →