Nesting and almost resolvability of pentagon systems
From MaRDI portal
Publication:2639064
DOI10.1016/S0195-6698(88)80005-2zbMath0718.05011MaRDI QIDQ2639064
C. A. Rodger, Charles C. Lindner
Publication date: 1988
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(88)80005-2
05C35: Extremal problems in graph theory
05B30: Other designs, configurations
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05B07: Triple systems
Related Items
Nesting of cycle systems of odd length, Near 2-factorizations of \(2K_ n:\) Cycles of even length, Nesting directed cycle systems of even length, Almost resolvable decompositions of \(2K_ n\) into cycles of odd length, Small embeddings for partial cycle systems of odd length
Cites Work
- Steiner pentagon systems
- The spectrum of nested Steiner triple systems
- On resolvable balanced incomplete block designs
- Self-orthogonal latin squares of all orders 𝑛≠2,3,6
- On the cyclic decompositions of the complete graph into polygons with odd number of edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item