Resolvability of infinite designs
From MaRDI portal
Publication:2434885
DOI10.1016/j.jcta.2013.11.005zbMath1281.05034MaRDI QIDQ2434885
Daniel Horsley, Bridget S. Webb, Peter Danziger
Publication date: 31 January 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2013.11.005
05B30: Other designs, configurations
Related Items
Factorizing the Rado graph and infinite complete graphs, Infinite Latin squares: neighbor balance and orthogonality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Doubly resolvable designs
- On infinite Steiner systems
- Unendliche gefaserte Steinersysteme
- An orbit theorem for Steiner triple systems
- Transfinite methods in geometry
- Orbits of infinite block designs
- The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
- Orthogonal resolutions of lines in AG(n,q)
- Existential closure of block intersection graphs of infinite designs having finite block size and index
- Existential closure of block intersection graphs of infinite designs having infinite block size
- On sparse countably infinite Steiner triple systems
- Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
- One-factorizations of the complete graph—A survey
- Algebraic Speculations About Steiner Systems
- Note on large sets of infinite steiner systems
- What is an infinite design?
- Block transitive Steiner systems with more than one point orbit
