Proof of the 1-factorization and Hamilton decomposition conjectures

Csaba, B., Kühn, D., Lo, A., Osthus, D., & Treglown, A. (2016). Proof of the 1-factorization and Hamilton decomposition conjectures. Memoirs of the American Mathematical Society.

Type

Journal article

Intellectual base

Primary research

Year

2016

DOI

10.1090/memo/1154

DOI registrant

American Mathematical Society

Link

https://doi.org/10.1090/memo/1154

Cited by

1 citation across 1 artifact.

Domain-specific

• Graph factorization
  • A graph factor is a spanning subgraph, and a factorization partitions the graph's edges into factors satisfying a specified regularity property.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:5968380c6a91 · see in the full table