t-designs on hypergraphs

Cites Work

Cited In (77)

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
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
Some new families of 3-regular self-complementary \(k\)-hypergraphs
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
The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points
On the automorphism group of a binary \(q\)-analog of the Fano plane
Transitive Steiner triple systems of order 25
New lower bounds for binary constant-dimension subspace codes
Graphical \(t\)-designs with block sizes three and four
Large sets of t-designs from groups
New coverings oft-sets with (t + 1)-sets
The existence of simple \(6\text{-}(14,7,4)\) designs
Maximum \(w\)-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes
Large sets of \(t\)-designs through partitionable sets: a survey
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
New \(t\)-designs and large sets of \(t\)-designs
t-designs from the large Mathieu groups
Large sets of subspace designs
New quasi-symmetric designs by the Kramer-Mesner method
Title not available (Why is that?)
Bounding graphical \(t\)-wise balanced designs
Existence of \(q\)-analogs of Steiner systems
A generalization of Connor's inequality to t-designs with automorphisms
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
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
Vector space partitions of GF(2)^8
On graphical quintuple systems
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
\(q\)-analogs of packing designs
Janko sporadic group \(\mathrm{J}_2\) as automorphism group of 3-designs
More mutually disjoint Steiner systems \(S(5,8,24)\)
Orbits on the projective line
A recursive construction for simple \(t\)-designs using resolutions
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\Sigma L(2,3^5)\)
Automorphisms of 2-(22,8,4) designs
Classifying 3- and 4-designs on 28 points invariant under the group \(S_6(2)\)
On the possible automorphism groups of a Steiner quintuple system of order 21
Enumeration of small nonisomorphic 1-rotational twofold triple systems
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\)
Kramer-Mesner theorem: characterization of 2-designs through systems of Diophantine equations
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)\)
Partial geometric designs having circulant concurrence matrices
Partitionable sets, almost partitionable sets, and their applications
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
Some new 3-designs invariant under the groups \(Sz(8)\) and \(S_6(2)\)
Some new 6-(14, 7, 4) designs
Constructions of new matroids and designs over \(\mathbb{F}_q\)
\(q\)-analogs of \(t\)-wise balanced designs from Borel subgroups

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)