Coloring Steiner Triple Systems

DOI10.1137/0603023zbMath0501.05036OpenAlexW2055414226MaRDI QIDQ3966168

Marcia de Brandes, Vojtěch Rödl, Kevin T. Phelps

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603023

zbMATH Keywords

3-uniform hypergraphchromatic number of Steiner triple systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Related Items

Coloring Block Designs is NP-Complete, Linear spaces with many small lines, The strong chromatic number of partial triple systems, Balanced Steiner triple systems, Star chromatic numbers of hypergraphs and partial Steiner triple systems, Equitable embeddings of Steiner triple systems, Embeddings of a graph into a surface with different weak chromatic numbers, Constructing 3-chromatic Steiner triple systems, The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar, Unnamed Item, Colourings of star systems, On balanced incomplete block designs with specified weak chromatic number, On cycle systems with specified weak chromatic number, Colouring even cycle systems, On three measures of non-convexity, On list coloring Steiner triple systems, Colouring Steiner quadruple systems, Cliques in Steiner systems, Chromatic numbers of simplicial manifolds, On the chromatic number of Steiner triple systems of order 25, Coloring face-hypergraphs of graphs on surfaces, Unbalanced Steiner triple systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of 1-factorizations of the complete graph
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• Asymptotic lower bounds for Ramsey functions
• On embedding incomplete symmetric Latin squares
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Graph Theory and Probability. II
• Some Remarks on the Triple Systems of Steiner.
• A Survey of Embedding Theorems for Steiner Systems
• On chromatic number of graphs and set-systems
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
• Symmetry groups of some perfect 1-factorizations of complete graphs
• Colouring Steiner quadruple systems