t-designs on hypergraphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3484077 (Why is no real title available?)
- scientific article; zbMATH DE number 3448595 (Why is no real title available?)
- scientific article; zbMATH DE number 3428933 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- scientific article; zbMATH DE number 3349863 (Why is no real title available?)
- scientific article; zbMATH DE number 3407678 (Why is no real title available?)
- An infinite class of 5-designs
- On t-Designs and Groups
- Parallel concepts in graph theory
- The module structure of integral designs
Cited in
(77)- \(q\)-analogs of \(t\)-wise balanced designs from Borel subgroups
- Classifying 3- and 4-designs on 28 points invariant under the group \(S_6(2)\)
- Search for combinatorial objects using lattice algorithms -- revisited
- The 2-rotational Steiner triple systems of order 25
- A construction of designs on \(n+1\) points from multiply homogeneous permutation groups of degree \(n\)
- Equations for coefficients of tactical decomposition matrices for \(t\)-designs
- On the possible automorphism groups of a Steiner quintuple system of order 21
- A family of \(t\)-regular self-complementary \(k\)-hypergraphs
- On decomposability of simple cyclic triple systems
- Classification of 6‐(14,7,4) designs with nontrivial automorphism groups
- Enumeration of small nonisomorphic 1-rotational twofold triple systems
- Some new families of 3-regular self-complementary \(k\)-hypergraphs
- Block designs from self-dual codes obtained from Paley designs and Paley graphs
- Bussey systems and Steiner's tactical problem
- Higher incidence matrices and tactical decomposition matrices
- Quasi-symmetric \(2\)-\((28,12,11)\) designs with an automorphism of order \(5\)
- On the large sets of t-designs of size nine
- Non-embeddable quasi-residual quasi-symmetric designs
- Disjoint \(q\)-Steiner systems in dimension 13
- The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two
- Kramer-Mesner theorem: characterization of 2-designs through systems of Diophantine equations
- On the automorphism group of a binary q-analog of the Fano plane
- Transitive Steiner triple systems of order 25
- The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points
- Graphical t-designs with block sizes three and four
- New lower bounds for binary constant-dimension subspace codes
- The existence of simple \(6\text{-}(14,7,4)\) designs
- Large sets of t-designs from groups
- New coverings oft-sets with (t + 1)-sets
- Large sets of t-designs through partitionable sets: a survey
- Maximum \(w\)-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes
- Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\)
- Intersection matrices revisited
- Some new large sets of \(t\)-designs
- Constructing two-weight codes with prescribed groups of automorphisms
- New infinite series of 2-designs over the binary and ternary field
- Graphical \(t\)-designs via polynomial Kramer-Mesner matrices
- Large sets of subspace designs
- New \(t\)-designs and large sets of \(t\)-designs
- t-designs from the large Mathieu groups
- New quasi-symmetric designs by the Kramer-Mesner method
- Bounding graphical \(t\)-wise balanced designs
- scientific article; zbMATH DE number 7124291 (Why is no real title available?)
- Partial geometric designs having circulant concurrence matrices
- Partitionable sets, almost partitionable sets, and their applications
- A generalization of Connor's inequality to t-designs with automorphisms
- Existence of \(q\)-analogs of Steiner systems
- New 2-edge-balanced graphs from bipartite graphs
- Hypergraphical \(t\)-designs
- Dominating sets for uniform subset graphs
- Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
- On the number of mutually disjoint cyclic designs
- On the non-existence of a projective \((75, 4, 12, 5)\) set in \(\mathrm{PG}(3, 7)\)
- An incidence algebra for t-designs with automorphisms
- Some new 3-designs invariant under the groups \(Sz(8)\) and \(S_6(2)\)
- A new series of large sets of subspace designs over the binary field
- New 2-designs over finite fields from derived and residual designs
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- Large sets of \(t\)-designs over finite fields
- On graphical quintuple systems
- Vector space partitions of GF(2)^8
- Nonexistence of block-transitive 6-designs
- Partial geometric designs with prescribed automorphisms
- Tactical decompositions of designs over finite fields
- Two 5-designs on 32 points
- Janko sporadic group \(\mathrm{J}_2\) as automorphism group of 3-designs
- \(q\)-analogs of packing designs
- More mutually disjoint Steiner systems \(S(5,8,24)\)
- Orbits on the projective line
- Some new 6-(14, 7, 4) designs
- A recursive construction for simple \(t\)-designs using resolutions
- Constructions of new matroids and designs over \(\mathbb{F}_q\)
- Graphical t-wise balanced designs
- On linear codes admitting large automorphism groups
- Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
- Steiner systems with automorphism groups PSL(2,71), PSL(2,83), and P L(2,3⁵)
- Automorphisms of 2-(22,8,4) designs
This page was built for publication: t-designs on hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1239745)