Explicit 2-factorizations of the odd graph (Q1765963): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11083-004-3344-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092341368 / rank | |||
Normal rank | |||
Revision as of 20:31, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit 2-factorizations of the odd graph |
scientific article |
Statements
Explicit 2-factorizations of the odd graph (English)
0 references
25 February 2005
0 references
The Odd graph \(O_k\) is the special Kneser graph \(O_k=K(2k-1,k-1)\) of order \(2k-1\choose k-1\). The authors show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph. In particular, they use the lexical matchings and modular matchings to present explicit constructions of two different 2-factorisations of the Odd graph.
0 references
Odd graph
0 references
Kneser graph
0 references
2-factor
0 references
2-factorisation
0 references
