Threshold conjecture for the index of squarefree powers of edge ideals
Statement
Let be a simple graph, let be its edge ideal, and let denote its th squarefree power. Let be the maximum size of a restricted matching in , with if no restricted matching exists. Squarefree-power threshold conjecture.
The preceding lemma proves for , while the paper notes that the asserted direction at and above the threshold is proved for cycles but remains open for general simple graphs.
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.