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

DOI10.1016/S0304-0208(08)73505-9MaRDI QIDQ3953804zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1016/S0304-0208(08)73505-9

zbMATH Keywords

idempotent commutative latin squaresintersection problemone-factorization

Mathematics Subject Classification ID

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

Cited in

(6)

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

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)