Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
DOI10.1002/JCD.3180020403zbMATH Open0856.05077OpenAlexW2094917808WikidataQ114236264 ScholiaQ114236264MaRDI QIDQ4764657FDOQ4764657
Authors: Gabor Korchmáros 
Publication date: 17 February 1997
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.3180020403
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Geometric group theory (20F65)
Cites Work
Cited In (15)
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- Nilpotent 1-factorizations of the complete graph
- Vertex‐regular 1‐factorizations in infinite graphs
- One-factorisations of complete graphs arising from ovals in finite planes
- Abelian 1-factorizations of the complete graph
- Sharply transitive 1-factorizations of complete multipartite graphs
- Symmetric 1-factorizations of the complete graph
- Abelian 1-factorizations in infinite graphs
- On circular--linear one-factorizations of the complete graph
- \(k\)-pyramidal one-factorizations
- On transitive one-factorizations of arc-transitive graphs
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Regular \(1\)-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
- Quaternionic 1-factorizations and complete sets of rainbow spanning trees
- One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane
This page was built for publication: Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764657)
