Strict realizability conjecture for K_2,3^'-free graphs
Statement
Let be a graph, let denote its strict realization space, and let denote the relevant matroid or independence structure. A graph is -free if it contains no subgraph isomorphic to .
Strict realizability conjecture. If is a -free graph which is independent in , then
This gives a sufficient condition for strict realizability. The source presents it as a conjecture following examples of graphs that are not strictly realizable.
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.