Coloring Steiner Triple Systems

DOI10.1137/0603023MaRDI QIDQ3966168zbMATH OpenOpenAlexFDO

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

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

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

Cites work

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

Cited in

(26)

• The strong chromatic number of partial triple systems
• Unbalanced Steiner triple systems
• Linear spaces with many small lines
• Balanced Steiner triple systems
• Constructing 3-chromatic Steiner triple systems
• Coloring face-hypergraphs of graphs on surfaces
• Star chromatic numbers of hypergraphs and partial Steiner triple systems
• Equitable embeddings of Steiner triple systems
• On cycle systems with specified weak chromatic number
• On balanced incomplete block designs with specified weak chromatic number
• Colouring even cycle systems
• On the chromatic number of Steiner triple systems of order 25
• Embeddings of a graph into a surface with different weak chromatic numbers
• The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar
• On list coloring Steiner triple systems
• Cliques in Steiner systems
• Coloring Block Designs is NP-Complete
• Equitably 2-colourable even cycle systems
• On three measures of non-convexity
• Colouring Steiner quadruple systems
• Colourings of star systems
• Colourings of path systems
• Large cliques or cocliques in hypergraphs with forbidden order-size pairs
• Weak colourings of Kirkman triple systems
• Colourings of uniform group divisible designs and maximum packings
• Chromatic numbers of simplicial manifolds

This page was built for publication: Coloring Steiner Triple Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3966168)