Switching in one-factorisations of complete graphs
atomic Latin squaregroup divisible designHamiltonian Latin squareone-factorisationperfect one-factorisationswitching
Orthogonal arrays, Latin squares, Room squares (05B15) Graph designs and isomorphic decomposition (05C51) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Summary: We define two types of switchings between one-factorisations of complete graphs, called factor-switching and vertex-switching. For each switching operation and for each \(n\leq 12\), we build a switching graph that records the transformations between isomorphism classes of one-factorisations of \(K_{n}\). We establish various parameters of our switching graphs, including order, size, degree sequence, clique number and the radius of each component.{ }As well as computing data for \(n\leq12\), we demonstrate several properties that hold for one-factorisations of \(K_{n}\) for general \(n\). We show that such factorisations have a parity which is not changed by factor-switching, and this leads to disconnected switching graphs. We also characterise the isolated vertices that arise from an absence of switchings. For factor-switching the isolated vertices are perfect one-factorisations, while for vertex-switching the isolated vertices are closely related to atomic Latin squares.
- scientific article; zbMATH DE number 3912422
- On one-factorizations of the complete graph
- scientific article; zbMATH DE number 124525
- scientific article; zbMATH DE number 6843209
- One-factorizations of the complete graph—A survey
- scientific article; zbMATH DE number 17815
- On the number of 1-factorizations of a complete graph
- On switching classes of graphs
- Factorizations of complete graphs into cycles and 1-factors
- scientific article; zbMATH DE number 894695
- \(k\)-cycle free one-factorizations of complete graphs
- Atomic Latin squares based on cyclotomic orthomorphisms
- Atomic Latin squares of order eleven
- Cycle switches in Latin squares
- Generating uniformly distributed random latin squares
- How not to prove the Alon-Tarsi conjecture
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 979131 (Why is no real title available?)
- scientific article; zbMATH DE number 1404121 (Why is no real title available?)
- scientific article; zbMATH DE number 5239164 (Why is no real title available?)
- Intersection of perfect 1-factorizations of complete graphs
- Mappings of Latin squares
- New families of atomic Latin squares and perfect 1-factorisations.
- On the number of 1-factorizations of the complete graph
- On triple systems and strongly regular graphs
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- Practical graph isomorphism. II.
- Properties of the Steiner triple systems of order 19
- Switching codes and designs
- Symmetries that latin squares inherit from 1‐factorizations
- The CRC handbook of combinatorial designs
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- The theory and application of latin bitrades: A survey
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- There are 526,915,620 nonisomorphic one‐factorizations of K12
- One-factorisations of complete graphs arising from ovals in finite planes
- Parity of sets of mutually orthogonal Latin squares
- Parity of transversals of Latin squares
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling
- Efficient, local and symmetric Markov chains that generate one-factorizations
- Perfect one-factorizations arising from the Lee metric
- Latin squares with a unique intercalate
- On one test for the switching separability of graphs modulo q
- Perfect 1-factorisations of \(K_{16}\)
- Enumeration of Latin squares with conjugate symmetry
This page was built for publication: Switching in one-factorisations of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405262)
