Explicit 2-factorizations of the odd graph
type: Item
instance of: scholarly article
title: Explicit 2-factorizations of the odd graph
zbMATH Open document ID: 1056.05115
author: J. Robert Johnson
author: H. A. Kierstead
published in: Order
publication date: 2005-02-25T00:00:00Z
review text: 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.
reviewed by: Lutz Volkmann
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 2138858
zbMATH Keywords: Odd graph
zbMATH Keywords: Kneser graph
zbMATH Keywords: 2-factor
zbMATH Keywords: 2-factorisation
MaRDI profile type: Publication
full work available at URL: s11083-004-3344-x
OpenAlex ID: W2092341368
Wikidata QID: Q47647672
cites work: Q3936766
cites work: An explicit 1-factorization in the middle of the Boolean lattice
cites work: More odd graph theory
cites work: Explicit matchings in the middle levels of the Boolean lattice
cites work: Q4458210
DOI: 10.1007/S11083-004-3344-X
Recommended article: Q4405642
Recommended article: Q5421127
Recommended article: Some results on odd factors of graphs
Recommended article: Primitive 2-factorizations of the complete graph
Recommended article: Q3644666
Recommended article: Two sufficient conditions for odd \([1,b]\)-factors in graphs
Recommended article: On 2-factors of a bipartite graph
Recommended article: On oriented 2-factorable graphs
Recommended article: Even [a,b]-factors in graphs
Recommended article: 2-factors in triangle-free graphs
description: scientific article; zbMATH DE number 2138858