Graph factorization, general triple systems, and cyclic triple systems
From MaRDI portal
Publication:1155058
DOI10.1007/BF02190154zbMath0466.05011MaRDI QIDQ1155058
Ralph G.Stanton, Ian P. Goulden
Publication date: 1981
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/136848
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Steiner systems in finite geometry (51E10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (13)
The existence of near-Skolem and hooked near-Skolem sequences ⋮ Balanced ternary designs with block size three, any \(\Lambda\) and any R ⋮ The spectrum for three-times repeated blocks in an \(S_ 3(2,3,v)\) ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ On a conjecture about \((m_1,m_2)\)-near-Skolem sequences ⋮ More balanced ternary designs with block size three ⋮ Row-column directed block designs ⋮ Generalizations of results of Stanton on BIBDs ⋮ A family of balanced ternary designs with block size four ⋮ Totally symmetric Latin squares with prescribed intersection numbers ⋮ Triples, current graphs and biembeddings ⋮ Starter sequences and M-fold starter sequences: How can you begin? ⋮ Indecomposable \(S_ 6(2,3,v)'s\)
Cites Work
This page was built for publication: Graph factorization, general triple systems, and cyclic triple systems
