The strongly chordal graph conjecture for graphic arrangements
Statement
For a simple graph , let denote its graphic arrangement. A graph is strongly chordal if it has no induced -sun for . An arrangement is flag-accurate when it admits a flag satisfying the required accuracy condition. Strongly chordal flag-accuracy conjecture. If is a strongly chordal graph, then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.