scientific article; zbMATH DE number 3520420
From MaRDI portal
Publication:4100097
zbMath0333.05007MaRDI QIDQ4100097
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Graph theory (05C99) Theory of error-correcting codes and error-detecting codes (94B99) Designs and configurations (05B99) Multiply transitive finite groups (20B20)
Related Items (64)
Zur Vervollständigung von Dreiecksräumen. (Completing triangle spaces) ⋮ Embedding connected factorizations ⋮ Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations ⋮ Some bounds for the number of blocks. III. ⋮ Conditions ensuring starter induced 1‐factorizations are not isomorphic ⋮ Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs ⋮ A Howell design admitting \(A_ 5\) ⋮ Large sets of \(t\)-designs through partitionable sets: a survey ⋮ A geometric construction of the Steiner system \(S(5,8,24)\) ⋮ An inequality for Steiner systems. II ⋮ A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k\)-matching] ⋮ Helly-type theorems about sets ⋮ Steiner Triple Systems with High Chromatic Index ⋮ Block-transitive \(3\)-\((v, k, 1)\) designs associated with alternating groups ⋮ Some remarks on subdesigns of symmetric designs ⋮ Unnamed Item ⋮ Block-transitive automorphism groups of Steiner 3-designs ⋮ Quaternionic 1-factorizations and complete sets of rainbow spanning trees ⋮ Unifying some known infinite families of combinatorial 3-designs ⋮ 1-homogeneous graphs with cocktail party \({\mu}\)-graphs ⋮ 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 ⋮ Number of 1-factorizations of regular high-degree graphs ⋮ Sampling complete designs ⋮ Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations ⋮ The classification of flag-transitive Steiner 4-designs ⋮ A census of highly symmetric combinatorial designs ⋮ A hyperfactorization of order 8, index 2 ⋮ On regular set systems containing regular subsystems ⋮ Nilpotent 1-factorizations of the complete graph ⋮ Orthogonal partitions in designed experiments ⋮ On the numbers of 1-factors and 1-factorizations of hypergraphs ⋮ Primitive one-factorizations and the geometry of mixed translations ⋮ The structure of symmetry groups of almost perfect one factorizations ⋮ On the Cameron-Praeger conjecture ⋮ Block-transitive designs in affine spaces ⋮ Asymptotic enumeration of Latin rectangles ⋮ Symmetric 1-factorizations of the complete graph ⋮ Block designs with block size two ⋮ Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations ⋮ Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ One-factorizations of complete graphs with vertex-regular automorphism groups ⋮ \(k\)-pyramidal one-factorizations ⋮ Block colourings of 6-cycle systems ⋮ Higher melonic theories ⋮ Some extremal connectivity results for matroids ⋮ A bibliographic survey of edge‐colorings ⋮ Primitive permutation groups and their section-regular partitions. ⋮ Isomorphic factorizations X: Unsolved problems ⋮ An association scheme for the 1-factors of the complete graph ⋮ The family of t-designs. II ⋮ A generalisation of \(t\)-designs ⋮ Multicolored parallelisms of Hamiltonian cycles ⋮ Some bounds for the number of blocks ⋮ On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups ⋮ Pairwise balanced designs whose line sizes do not divide six ⋮ One–factorizations of complete graphs with regular automorphism groups ⋮ There are 526,915,620 nonisomorphic one‐factorizations of K12 ⋮ The structure of symmetry groups of GK(2n, G) ⋮ On the number of 1-factorizations of a complete graph ⋮ On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs
This page was built for publication:
