ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite simple graph. A 11-factor of GG is a spanning 11-regular subgraph of GG, i.e. a perfect matching. A 11-factorization of GG is a partition of the edge set E(G)E(G) into 11-factors, and GG is called 11-factorable if it admits a 11-factorization.

For every integer n≥1n \ge 1 and every kk-regular graph GG on 2n2n vertices, if

k≥nwhen n is odd,k≥n−1when n is even,k \ge n \quad \text{when } n \text{ is odd,} \qquad k \ge n-1 \quad \text{when } n \text{ is even,}

then GG is 11-factorable; that is, E(G)E(G) can be partitioned into kk pairwise disjoint perfect matchings of GG.

Record

Added
Links

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.