In: Advanced Math
Null graph,Nn, n=1,2,3,4...,the graph with n vertices and no edges. (N4=4 vertices with no edges)
4 a) find a graph with 8 vertices with no 3-cycles and no induced sub graph isomorphic to N4
b)prove that every simple graph with 9 vertices with no 3-cycles has an induced sub graph isomorphic to N4