Proof of the 1-factorization and Hamilton decomposition conjectures

Béla Csaba, D. K., Lo, A., Osthus, D., & Treglown, A. (1154). Proof of the 1-factorization and Hamilton decomposition conjectures.

Type

Unclassified

Intellectual base

Unclassified

Year

1154

DOI

10.1090/memo/1154

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

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