Extending bicolorings for Steiner triple systems

DOI10.2298/AADM130827019GMaRDI QIDQ5259398zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

coloringsmixed hypergraphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Triple systems (05B07) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Steiner systems in finite geometry (51E10)

Abstract: We initiate the study of extended bicolorings of Steiner triple systems (STS) which start with a $k$-bicoloring of an STS($v$) and end up with a $k$-bicoloring of an STS($2v+1$) obtained by a doubling construction, using only the original colors used in coloring the subsystem STS($v$). By producing many such extended bicolorings, we obtain several infinite classes of orders for which there exist STSs with different lower and upper chromatic number.

Recommendations

• Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
• Bicoloring Steiner triple systems
• Bicolouring Steiner systems \(S\)(2,4,\(v\))
• Feasible sets of small bicolorable STSs
• Bicolour graphs of Steiner triple systems

Cited in

(18)

• Bicoloring Steiner triple systems
• Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
• Bicolouring Steiner systems \(S\)(2,4,\(v\))
• Bicolour graphs of Steiner triple systems
• Alexandroff topologies and monoid actions
• Steiner systems and configurations of points
• Lattice representations with set partitions induced by pairings
• Set relations and set systems induced by some families of integral domains
• \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
• Feasible sets of small bicolorable STSs
• scientific article; zbMATH DE number 1556742 (Why is no real title available?)
• Indiscernibility structures induced from function sets: graph and digraph case
• Mixed hypergraphs and beyond
• Mario Gionfriddo and mixed hypergraph coloring
• Perfect blocking sets in \(P_3\)-designs
• Some classifications of graphs with respect to a set adjacency relation
• Granular computing on basic digraphs
• Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners

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)