The following pages link to (Q4100097):
Displaying 50 items.
- Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations (Q289992) (← links)
- Some bounds for the number of blocks. III. (Q297934) (← links)
- Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs (Q322196) (← links)
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching (Q400365) (← links)
- On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) (← links)
- Sampling complete designs (Q658083) (← links)
- Orthogonal partitions in designed experiments (Q677159) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- Large sets of \(t\)-designs through partitionable sets: a survey (Q856838) (← links)
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs (Q871281) (← links)
- On the Cameron-Praeger conjecture (Q966062) (← links)
- Block-transitive designs in affine spaces (Q970536) (← links)
- Symmetric 1-factorizations of the complete graph (Q976163) (← links)
- \(k\)-pyramidal one-factorizations (Q995770) (← links)
- Primitive permutation groups and their section-regular partitions. (Q1024884) (← links)
- A generalisation of \(t\)-designs (Q1044956) (← links)
- Multicolored parallelisms of Hamiltonian cycles (Q1044961) (← links)
- Pairwise balanced designs whose line sizes do not divide six (Q1053695) (← links)
- Zur Vervollständigung von Dreiecksräumen. (Completing triangle spaces) (Q1079568) (← links)
- Helly-type theorems about sets (Q1140667) (← links)
- Some remarks on subdesigns of symmetric designs (Q1145150) (← links)
- On the edge-colouring problem for unions of complete uniform hypergraphs (Q1157347) (← links)
- Eine Charakterisierung des Steinersystems S(5,8,24) (Q1158157) (← links)
- On intersections of symmetric subdesigns of symmetric designs (Q1169467) (← links)
- A hyperfactorization of order 8, index 2 (Q1182930) (← links)
- Some extremal connectivity results for matroids (Q1262315) (← links)
- On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs (Q1323492) (← links)
- A Howell design admitting \(A_ 5\) (Q1356445) (← links)
- A geometric construction of the Steiner system \(S(5,8,24)\) (Q1361717) (← links)
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs (Q1410769) (← links)
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations (Q1727772) (← links)
- Higher melonic theories (Q1797293) (← links)
- An association scheme for the 1-factors of the complete graph (Q1837693) (← links)
- The family of t-designs. II (Q1838009) (← links)
- Some bounds for the number of blocks (Q1840833) (← links)
- An inequality for Steiner systems. II (Q1911240) (← links)
- On regular set systems containing regular subsystems (Q1979429) (← links)
- Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations (Q2014215) (← links)
- Embedding connected factorizations (Q2131871) (← links)
- Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
- Block designs with block size two (Q2266554) (← links)
- On the number of 1-factorizations of a complete graph (Q2352638) (← links)
- Unifying some known infinite families of combinatorial 3-designs (Q2431267) (← links)
- The classification of flag-transitive Steiner 4-designs (Q2457935) (← links)
- A census of highly symmetric combinatorial designs (Q2458258) (← links)
- Primitive one-factorizations and the geometry of mixed translations (Q2470437) (← links)
- Quaternionic 1-factorizations and complete sets of rainbow spanning trees (Q2689122) (← links)
- One-factorizations of complete graphs with vertex-regular automorphism groups (Q2782293) (← links)
- One–factorizations of complete graphs with regular automorphism groups (Q3439435) (← links)
- Block colourings of 6-cycle systems (Q4690992) (← links)
