Extending bicolorings for Steiner triple systems
DOI10.2298/AADM130827019GzbMATH Open1408.05096arXiv1106.1762OpenAlexW2962680068MaRDI QIDQ5259398FDOQ5259398
Authors: Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo
Publication date: 26 June 2015
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.1762
Recommendations
Combinatorial aspects of block designs (05B05) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Steiner systems in finite geometry (51E10) Triple systems (05B07)
Cited In (17)
- Indiscernibility structures induced from function sets: graph and digraph case
- Some classifications of graphs with respect to a set adjacency relation
- Set relations and set systems induced by some families of integral domains
- Mario Gionfriddo and mixed hypergraph coloring
- Bicolouring Steiner systems \(S\)(2,4,\(v\))
- Perfect blocking sets in \(P_3\)-designs
- Steiner systems and configurations of points
- Granular computing on basic digraphs
- Alexandroff topologies and monoid actions
- Feasible sets of small bicolorable STSs
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Title not available (Why is that?)
- Mixed hypergraphs and beyond
- Lattice representations with set partitions induced by pairings
- Bicolour graphs of Steiner triple systems
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
- Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
This page was built for publication: Extending bicolorings for Steiner triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259398)