ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A brace is a bipartite matching covered graph, and a graph is cycle-conformal if every even cycle CC has the property that deleting its vertices leaves a graph with a perfect matching. For an integer ℓ≥2\ell\geq 2, an ℓ\ell-regular graph is one in which every vertex has degree ℓ\ell. Regular cycle-conformal brace conjecture. For each integer ℓ≥2\ell\geq 2, the only ℓ\ell-regular, cycle-conformal brace is Kℓ,ℓK_{\ell,\ell}. The conjecture extends the known cases: the cubic case ℓ=3\ell=3 is proved by the paper's theorem, and the case ℓ=2\ell=2 is immediate from C4=K2,2C_4=K_{2,2}.

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.