Hypergraphical t-designs
From MaRDI portal
Publication:2497499
Recommendations
Cites work
- An \(S_ 3(3,5,21)\) using graphs
- An improved finiteness theorem for graphical t-designs
- Block-transitive \(t\)-designs. I: Point-imprimitive designs
- Graphical \(t\)-designs via polynomial Kramer-Mesner matrices
- Graphical t-designs with block sizes three and four
- Graphical t-wise balanced designs
- scientific article; zbMATH DE number 874522 (Why is no real title available?)
- New \(t\)-designs and large sets of \(t\)-designs
- On the construction of block designs
- Simple non-trivial designs with an arbitrary automorphism group
- t-designs on hypergraphs
- The existence of a simple 3-(28,5,30) design
- There exists a simple non trivial \(t\)-design with an arbitrarily large automorphism group for every \(t\)
Cited in
(9)- Signed hypergraph designs and diagonal forms for some incidence matrices
- scientific article; zbMATH DE number 426158 (Why is no real title available?)
- An enumeration of graphical designs
- scientific article; zbMATH DE number 4041961 (Why is no real title available?)
- scientific article; zbMATH DE number 1279028 (Why is no real title available?)
- scientific article; zbMATH DE number 874522 (Why is no real title available?)
- Tort-Decó: A ``Turtle geometry-based package for drawing periodic designs
- An improved finiteness theorem for graphical t-designs
- Optimal and extremal graphical designs on regular graphs associated with classical parameters
This page was built for publication: Hypergraphical \(t\)-designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497499)