✦ LIBER ✦

Upper chromatic number of Steiner triple and quadruple systems

✍ Scribed by Lorenzo Milazzo; Zsolt Tuza

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 630 KB
Volume: 174
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)80332-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic numbers of Steiner trip

On the chromatic numbers of Steiner triple systems

✍ Lucien Haddad 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

Geometric properties are used to determine the chromatic number of AG(4, 3) and to derive some important facts on the chromatic number of PG(n, 2). It is also shown that a 4-chromatic STS(v) exists for every admissible order v ≥ 21.

Codes of Steiner triple and quadruple sy

Codes of Steiner triple and quadruple systems

✍ J. D. Key; F. E. Sullivan 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 514 KB

Existence of 3-chromatic Steiner quadrup

Existence of 3-chromatic Steiner quadruple systems

✍ L. Ji 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract A __Steiner quadruple system__ of order __v__ (briefly SQS (__v__)) is a pair (__X__, $\cal B$), where __X__ is a __v__‐element set and $\cal B$ is a set of 4‐element subsets of __X__ (called __blocks__ or __quadruples__), such that each 3‐element subset of __X__ is contained in a uniqu

Star chromatic numbers of hypergraphs an

Star chromatic numbers of hypergraphs and partial Steiner triple systems

✍ L. Haddad; H. Zhou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 635 KB

The concept of star chromatic number of a graph, introduced by Vince ( ) is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by . In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and

Specialized Block-Colourings of Steiner

Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index

✍ C.J. Colbourn; A. Rosa 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 300 KB

5-chromatic steiner triple systems

✍ Jean Fugère; Lucien Haddad; David Wehlau 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 791 KB

## Abstract We show that, up to an automorphism, there is a unique independent set in PG(5,2) that meets every hyperplane in 4 points or more. Using this result, we show that PG(5,2) is a 5‐chromatic STS. Moreover, we construct a 5‐chromatic STS(__v__) for every admissible __v__ ≥ 127. © 1994 John