ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a simple graph GG, let AG\mathscr{A}_G denote its graphic arrangement. A graph is strongly chordal if it has no induced nn-sun for n≥3n\geq 3. An arrangement is flag-accurate when it admits a flag satisfying the required accuracy condition. Strongly chordal flag-accuracy conjecture. If GG is a strongly chordal graph, then AG\mathscr{A}_G is flag-accurate. The conjecture is presented as the graphic counterpart of the open question whether all MAT-free arrangements are flag-accurate; the paper does not report a general resolution.

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.