Complete-bipartite spanning-subgraph conjecture for extremal flag Betti numbers
Statement
Let denote the collection of graphs on vertices and edges, and let denote the first flag-complex Betti number of a graph .
Complete-bipartite spanning-subgraph conjecture. If and
then contains a complete bipartite spanning subgraph.
This conjecture proposes a structural characterization of graphs attaining the extremal first flag-complex Betti number for fixed numbers of vertices and edges. The source presents the problem as a challenging direction for future research and gives an example showing that extremal graphs need not contain a Turán graph as a spanning subgraph.
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.