ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph, let II be its edge ideal, and let I[k]I^{[k]} denote its kkth squarefree power. Let ν0(G)\nu_0(G) be the maximum size of a restricted matching in GG, with ν0(G)=1\nu_0(G)=1 if no restricted matching exists. Squarefree-power threshold conjecture.

\index(I[k])>1if and only ifk≥ν0(G).\index(I^{[k]})>1\quad\text{if and only if}\quad k\geq\nu_0(G).

The preceding lemma proves \index(I[k])=1\index(I^{[k]})=1 for 0<k<ν0(G)0<k<\nu_0(G), 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 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.