Closed math1um closed 3 years ago
The graph which is a cycle on 6 vertices amalgamated to a path on 3 vertices is a counterexample to the conjecture:
If a graph is not matching robust then the graph is maximal triangle-free
tadpole_6_2 = graphs.TadpoleGraph(6,2)
See: https://en.wikipedia.org/wiki/Tadpole_graph
added
The graph which is a cycle on 6 vertices amalgamated to a path on 3 vertices is a counterexample to the conjecture:
If a graph is not matching robust then the graph is maximal triangle-free
tadpole_6_2 = graphs.TadpoleGraph(6,2)