Revision as of 07:53, 19 June 2025 edit Sowhates (talk \| contribs) 28 edits →1-factorization conjecture ← Previous edit		Latest revision as of 07:53, 19 June 2025 edit undo Sowhates (talk \| contribs) 28 edits →1-factorization conjecture
Line 32: * If ''n'' is odd and ''k'' ≥ ''n'', then ''G'' is 1-factorable. If ''n'' is even and ''k'' ≥ ''n'' − 1 then ''G'' is 1-factorable. The [[overfull conjecture]] implies the 1-factorization conjecture. The conjecture was confirmed by Csaba, Kühn, Lo, Osthus and Treglown for sufficiently large ''n''.<ref name="csaba"> ~~<ref name="csaba">~~ {{Citation \| last1 = Csaba

Graph factorization: Difference between revisions