Hanani triple systems
Hanani triple systems on \(v \equiv 1 \pmod 6\) elements are Steiner triple systems having \((v-1)/2\) pairwise disjoint almost parallel classes (sets of pairwise disjoint triples that span \(v-1\) elements), and the remaining triples form a parallel class. Hanani triple systems are one natural analogue of the Kirkman triple systems on \(v \equiv 3 \pmod 6\) elements, which form the solution of the celebrated Kirkman schoolgirl problem. The authors prove that a Hanani triple system exists for all \(v \equiv 1 \pmod 6\) except for \(v \in \{7,13\}\). This result has many applications in design constructions (e.g., for almost resolvable twofold triple systems), and suggests a number of generalizations and open problems, especially on minimum chromatic index of designs.
- Asymptotic behavior of the chromatic index for hypergraphs
- Frames for Kirkman triple systems
- Greedy Colourings of Steiner Triple Systems
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 4006279 (Why is no real title available?)
- scientific article; zbMATH DE number 4059426 (Why is no real title available?)
- scientific article; zbMATH DE number 124517 (Why is no real title available?)
- scientific article; zbMATH DE number 124522 (Why is no real title available?)
- scientific article; zbMATH DE number 3485815 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- On resolvable balanced incomplete block designs
- Steiner Systems and Room Squares
- The chromatic index of cyclic Steiner 2-designs
- Some new Kirkman signal sets
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
- On the chromatic index of path decompositions
- On the edge-coloring property for Hanani triple systems
- Egalitarian Steiner triple systems for data popularity
- Hanani triple packings and optimal \(q\)-ary codes of constant weight three
- Almost resolvable cycle systems --an analogue of Hanani triple systems
- Generalized packing designs
- f-vectors of pure complexes and pure multicomplexes of rank three
- Steiner triple systems with high chromatic index
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
- The chromatic index of projective triple systems
- Block colourings of star systems
- Graph and hypergraph colouring via nibble methods: a survey
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs
- Almost resolvable duplicated Steiner triple systems
- On the existence of cycle frames and almost resolvable cycle systems
- The generalized almost resolvable cycle system problem
- The Hamilton-Waterloo problem for triangle-factors and Hamiltonian cycles solved
- Trails of triples in partial triple systems
- Steiner quadruple systems with minimum colorable derived designs: constructions and applications
- Weak and strong nestings of BIBDs
- More results on cycle frames and almost resolvable cycle systems
- Twofold 2-perfect bowtie systems with an extra property
- Zero-sum flows for triple systems
- Guest editorial: Special issue in honor of Scott A. Vanstone
- Almost resolvable maximum packings of complete graphs with 5-cycles
This page was built for publication: Hanani triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690071)
