A Note on One-Factorizations Having a Prescribed Number of Edges in Common

DOI10.1016/S0304-0208(08)73505-9zbMATH Open0492.05055MaRDI QIDQ3953804FDOQ3953804

Authors: C. C. Lindner, Walter D. Wallis 

Publication date: 1982

Published in: Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

zbMATH Keywords

intersection problemone-factorizationidempotent commutative latin squares

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)

Cited In (6)

• Intersection problem of Steiner systems S(3,4,2v)
• On the intersection of two S(3,4,2v) having a same derived triple system
• Totally symmetric Latin squares with prescribed intersection numbers
• The spectrum for three-times repeated blocks in an \(S_ 3(2,3,v)\)
• Complete sets of disjoint difference families and their applications
• The intersection problem for \(\text{PBD}(5^{*},3)\)s

This page was built for publication: A Note on One-Factorizations Having a Prescribed Number of Edges in Common

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953804)