Explicit 2-factorizations of the odd graph (Q1765963)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Explicit 2-factorizations of the odd graph |
scientific article; zbMATH DE number 2138858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit 2-factorizations of the odd graph |
scientific article; zbMATH DE number 2138858 |
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
0.9084165
0 references
0 references
0 references
0.89596957
0 references
0.89322424
0 references
0 references
0 references
0 references
0 references
