Minimum K_2,3-saturated Graphs

Details Minimum K_2,3-saturated Graphs Minimum K_2,3-saturated Graphs

2010-12-19

arxiv.org/abs/1012.4152v8

Mathematics

Combinatorics

10 pages; tiny change to version 7

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Minimum K_2,3-saturated Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimum K_2,3-saturated Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum K_2,3-saturated Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-725512