1-factorization conjecture
Statement
Let be a finite simple graph. A -factor of is a spanning -regular subgraph of , i.e. a perfect matching. A -factorization of is a partition of the edge set into -factors, and is called -factorable if it admits a -factorization.
For every integer and every -regular graph on vertices, if
then is -factorable; that is, can be partitioned into pairwise disjoint perfect matchings of .
Record
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.