A family of perfect factorisations of complete bipartite graphs (Q1601439): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q62638540, #quickstatements; #temporary_batch_1706897434465 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q62638540 / rank | |||
Normal rank |
Revision as of 21:15, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A family of perfect factorisations of complete bipartite graphs |
scientific article |
Statements
A family of perfect factorisations of complete bipartite graphs (English)
0 references
26 June 2002
0 references
A 1-factorization of a graph is called perfect if the union of any two of its 1-factors is a single (Hamiltonian) cycle. A Latin square is pan-Hamiltonian if the permutation determined by any pair of rows yields a single cycle. Let \(p\) be any odd prime and let \(n= p^2\). The authors construct \((p-1)/2\) non-isotopic pan-Hamiltonian Latin squares of order \(n\). Equivalently, this yields a family of \((p-1)/2\) non-isomorphic perfect 1-factorizations of the complete bipartite graph \(K_{n,n}\), thereby establishing existence for infinitly many new values of \(n\).
0 references
Latin square
0 references