search

math1um / objects-invariants-properties

Objects, Invariants and Properties for Graph Theory (GT) automated conjecturing: in particular with the Sage program CONJECTURING: http://nvcleemp.github.io/conjecturing/
GNU General Public License v3.0
14 stars 6 forks source link

Add graph to GT: bipartite_5_5_minus_edge #599

Closed math1um closed 3 years ago

math1um commented 6 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)

bipartite_5_5_minus_edge = graphs.CompleteBipartiteGraph(5,5) bipartite_5_5_minus_edge.delete_edge(0,5)

jaritaes99 commented 3 years ago

would this graph be named bipartite_5_5_minus_edge or would it be a ce# graph?

jaritaes99 commented 3 years ago

added