A family of perfect factorisations of complete bipartite graphs (Q1601439): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Ian M. Wanless / rank | |||
Property / reviewed by | |||
Property / reviewed by: Chester J. Salwach / rank | |||
Property / author | |||
Property / author: Ian M. Wanless / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q62638540 / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Chester J. Salwach / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2161669520 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian-connected self-complementary graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3921269 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4732479 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3972909 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PROPER LOOPS OF ORDER η IN WHICH EACH NON-IDENTITY ELEMENT HAS LEFT ORDER η / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4184869 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4745851 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal circuits in directed graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4388205 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4853711 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4332941 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:15, 4 June 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