ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=Cn,nG=C_{n,n} with n≥4n \ge 4. The graph GG is the crown graph obtained from the complete bipartite graph on two parts of size nn by deleting a perfect matching, and JGJ_G denotes its binomial edge ideal. For T∈C(G)T \in \mathcal{C}(G), let PT(G)P_T(G) be the corresponding prime ideal and let v⁡PT(G)(JG)\operatorname{v}_{P_T(G)}(J_G) denote the local v-number of JGJ_G at PT(G)P_T(G). The v-number conjecture for crown graphs. For every T∈C(G)T \in \mathcal{C}(G),

v⁡PT(G)(JG)=4.\operatorname{v}_{P_T(G)}(J_G)=4.

This would establish the expected upper value in the bound 3≤v⁡(JG)≤43\leq \operatorname{v}(J_G)\leq 4 for crown graphs with n≥4n\geq 4; the case T=∅T=\emptyset is already known, while the assertion for every cut-set prime remains open.

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.