ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D4\mathfrak{D}_4 be the graph class referenced in the paper, consisting of the relevant maximal triangle-free graphs satisfying property D4\mathcal{D}_4.

Finite forbidden-subgraph conjecture for D4\mathfrak{D}_4. There exists a finite family F\mathscr{F} of graphs such that D4\mathfrak{D}_4 is the class of maximal triangle-free graphs with at least two vertices that do not possess induced subgraphs in F\mathscr{F}.

The paper records that several forbidden induced subgraphs are known for D4\mathfrak{D}_4, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.