scientific article; zbMATH DE number 3520420
From MaRDI portal
Publication:4100097
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Designs and configurations (05B99) Graph theory (05C99) Multiply transitive finite groups (20B20) Theory of error-correcting codes and error-detecting codes (94B99)
Cited in
(70)- Primitive permutation groups and their section-regular partitions.
- A generalisation of \(t\)-designs
- Multicolored parallelisms of Hamiltonian cycles
- Pairwise balanced designs whose line sizes do not divide six
- Zur Vervollständigung von Dreiecksräumen. (Completing triangle spaces)
- Helly-type theorems about sets
- Some remarks on subdesigns of symmetric designs
- On the edge-colouring problem for unions of complete uniform hypergraphs
- Eine Charakterisierung des Steinersystems S(5,8,24)
- On intersections of symmetric subdesigns of symmetric designs
- A hyperfactorization of order 8, index 2
- Some extremal connectivity results for matroids
- On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs
- A Howell design admitting \(A_ 5\)
- A geometric construction of the Steiner system S(5,8,24)
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
- Higher melonic theories
- An association scheme for the 1-factors of the complete graph
- The family of t-designs. II
- Some bounds for the number of blocks
- An inequality for Steiner systems. II
- On regular set systems containing regular subsystems
- Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations
- Embedding connected factorizations
- Number of 1-factorizations of regular high-degree graphs
- Block designs with block size two
- On the number of 1-factorizations of a complete graph
- Unifying some known infinite families of combinatorial 3-designs
- The classification of flag-transitive Steiner 4-designs
- A census of highly symmetric combinatorial designs
- Primitive one-factorizations and the geometry of mixed translations
- Quaternionic 1-factorizations and complete sets of rainbow spanning trees
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
- Some bounds for the number of blocks. III.
- Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs
- One–factorizations of complete graphs with regular automorphism groups
- On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- A bibliographic survey of edge‐colorings
- Steiner triple systems with high chromatic index
- Block colourings of 6-cycle systems
- Isomorphic factorizations X: Unsolved problems
- There are 526,915,620 nonisomorphic one‐factorizations of K12
- The structure of symmetry groups of GK(2n, G)
- Conditions ensuring starter induced 1‐factorizations are not isomorphic
- Regular 1-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
- On the numbers of 1-factors and 1-factorizations of hypergraphs
- Nilpotent 1-factorizations of the complete graph
- Asymptotic enumeration of Latin rectangles
- The structure of symmetry groups of almost perfect one factorizations
- Computing Autotopism Groups of Partial Latin Rectangles
- Block-transitive \(3\)-\((v, k, 1)\) designs associated with alternating groups
- Block-transitive automorphism groups of Steiner 3-designs
- On the existence of block-transitive Steiner designs with k divides v
- Designs for half-diallel experiments with commutative orthogonal block structure
- Block-transitive \(3\)-\((v, k, 1)\) designs on exceptional groups of Lie type
- Sampling complete designs
- Orthogonal partitions in designed experiments
- Block-transitive Steiner 3-designs on 2-transitive groups
- Permutation groups, partition lattices and block structures
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Title not available (Why is no real title available?)
- Large sets of t-designs through partitionable sets: a survey
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
- On the Cameron-Praeger conjecture
- Block-transitive designs in affine spaces
- Symmetric 1-factorizations of the complete graph
- k-pyramidal one-factorizations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4100097)
