The following pages link to (Q3280507):
Displaying 16 items.
- Every SOMA\((n - 2, n)\) is Trojan (Q960928) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Embedding of orthogonal arrays of strength two and deficiency greater than two (Q1136456) (← links)
- Translations and construction of generalised nets (Q1167731) (← links)
- Collineations and extensions of translation nets (Q1214146) (← links)
- Affine resolvable balanced incomplete block designs: a survey (Q1227622) (← links)
- Translations and parallel classes of lines in affine designs (Q1236542) (← links)
- A note on embedding of orthogonal arrays of strength two (Q1257318) (← links)
- Laguerre planes of even order and translation ovals (Q1336237) (← links)
- Extending partial projective planes (Q1721743) (← links)
- A candidate for the ``Next Fermat Problem'' (Q1908694) (← links)
- Combinatorial methods in the construction of point sets with uniformity properties (Q1921093) (← links)
- Competition numbers and phylogeny numbers: uniform complete multipartite graphs (Q2000559) (← links)
- On the maximality of a set of mutually orthogonal sudoku Latin squares (Q2364632) (← links)
- Doubly-transitive groups, nearfields and geometry (Q2521011) (← links)
- A gap for the maximum number of mutually unbiased bases (Q2838954) (← links)
