ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers k≥1k\geq 1 and n≥2k+1n\geq 2k+1, let QG(n,k)QG(n,k) be the spanning subgraph of the Schrijver graph SG(n,k)SG(n,k) constructed in Theorem 1.1, which is a quadrangulation of Pn−2k\mathbb{P}^{n-2k} and satisfies χ(QG(n,k))=n−2k+2\chi(QG(n,k))=n-2k+2. A graph is edge-critical if deleting any edge decreases its chromatic number. Edge-criticality conjecture. For any k≥1k\geq 1 and n≥2k+1n\geq 2k+1, QG(n,k)QG(n,k) is edge-critical. The graph QG(n,k)QG(n,k) has the same chromatic number as SG(n,k)SG(n,k), and this conjecture proposes the edge-critical analogue of Schrijver's vertex-criticality result; it remains open in the source.

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.