Improvement of Bruck's completion theorem
From MaRDI portal
Publication:1182407
DOI10.1007/BF00157614zbMath0760.05012MaRDI QIDQ1182407
Publication date: 28 June 1992
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Finite affine and projective planes (geometric aspects) (51E15) Orthogonal arrays, Latin squares, Room squares (05B15) Translation planes and spreads in linear incidence geometry (51A40)
Related Items (16)
On the maximality of a set of mutually orthogonal sudoku Latin squares ⋮ Asymptotic Delsarte cliques in distance-regular graphs ⋮ Quasi-residual designs, \(1{1\over 2}\)-designs, and strongly regular multigraphs ⋮ A characterization of Grassmann graphs ⋮ A gap result for Cameron-Liebler \(k\)-classes ⋮ A bound on permutation codes ⋮ Parity of sets of mutually orthogonal Latin squares ⋮ Pairs of MOLS of order ten satisfying non-trivial relations ⋮ On the automorphism groups of strongly regular graphs. II. ⋮ Spectral characterization of the Hamming graphs ⋮ Translation nets: A survey ⋮ Maximal partial spreads and the modular \(n\)-queen problem ⋮ Maximal partial spreads and transversal-free translation nets ⋮ On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes ⋮ On the size of a maximal partial spread ⋮ Distance-regular graphs without 4-claws
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal partial spreads and translation nets of small deficiency
- Maximal partial spreads and two-weight codes
- Heden's bound on maximal partial spreads
- Strongly regular graphs, partial geometries and partially balanced designs
- Finite nets. II: Uniqueness and imbedding
- Sets of Disjoint Lines in PG(3, q)
- Partial Spreads and Replaceable Nets
- The Nonexistence of Certain Finite Projective Planes
- Linear spaces with few lines
This page was built for publication: Improvement of Bruck's completion theorem
