Regularity conjecture for weakly closed graphs
Statement
Let be a connected weakly closed graph, let , and let be its binomial edge ideal. Let denote the length of the longest induced path of . Regularity conjecture for weakly closed graphs. If the longest induced path of has length , then
The claim extends the corresponding result for connected closed graphs and the authors establish it for trees, where the relevant graphs are precisely caterpillar trees; the supplied text reports that the general weakly closed-graph case is motivated by computer experiments and leaves it as a conjecture.
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.