Finite forbidden-subgraph characterization of the class D_4
Statement
Let be the graph class referenced in the paper, consisting of the relevant maximal triangle-free graphs satisfying property .
Finite forbidden-subgraph conjecture for . There exists a finite family of graphs such that is the class of maximal triangle-free graphs with at least two vertices that do not possess induced subgraphs in .
The paper records that several forbidden induced subgraphs are known for , but that the analysis had not been completed. A finite characterization could provide an alternative proof of the paper's structural theorem.
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.