Closed math1um closed 3 years ago
Take the complete bipartite graph with 5,5 partition and remove any edge. This graph is a CE to the conjecture:
For any graph g, ((is_four_connected)^(is_strongly_regular))->(is_maximal_triangle_free)
bipartite_5_5_minus_edge = graphs.CompleteBipartiteGraph(5,5) bipartite_5_5_minus_edge.delete_edge(0,5)
would this graph be named bipartite_5_5_minus_edge or would it be a ce# graph?
added
Take the complete bipartite graph with 5,5 partition and remove any edge. This graph is a CE to the conjecture:
For any graph g, ((is_four_connected)^(is_strongly_regular))->(is_maximal_triangle_free)
bipartite_5_5_minus_edge = graphs.CompleteBipartiteGraph(5,5) bipartite_5_5_minus_edge.delete_edge(0,5)
bipartite_5_5_minus_edge = graphs.CompleteBipartiteGraph(5,5) bipartite_5_5_minus_edge.delete_edge(0,5)