Super-base graph conjecture for the graphs G_n,k
Statement
Let with and . Let be the graph from the paper, and let denote the graph obtained by deleting any vertex from its complement. A minimal prime graph is a graph with the minimal-prime property defined in the paper.
Super-base graph conjecture. For every such and , if is a minimal prime graph, then is not a minimal prime graph for any vertex ; consequently, these graphs cannot be generated from any minimal prime graph.
Computations for support the claim. It asserts that the indicated minimal prime graphs are super base graphs, meaning that they are not generated from any minimal prime graph.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.