Size in maximal triangle-free graphs and
โ
Curtiss Barefoot; Karen Casey; David Fisher; Kathryn Fraughnaugh; Frank Harary
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 290 KB
A triangle-free graph is maximal if the addition of any edge creates a triangle. For n ~> 5, we show there is an n-node m-edge maximal triangle-free graph if and only if it is complete bipartite or 2n-5<<.m<<.L(n-1)2/4J+l. A diameter 2 graph is minimal if the deletion of any edge increases the diame