✦ LIBER ✦

Star chromatic numbers of hypergraphs and partial Steiner triple systems

✍ Scribed by L. Haddad; H. Zhou

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 635 KB
Volume: 146
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00156-1

No coin nor oath required. For personal study only.

✦ Synopsis

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 study their basic properties. In particular, we focus on partial Steiner triple systems (PSTSs) for the weak case. We also discuss the computational complexity of finding a (k, d)-colouring for a PSTS and construct, for every rational k/d > 2, a k/d star chromatic PSTS.

📜 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.

Post's closed systems and the weak chrom

Post's closed systems and the weak chromatic number of hypergraphs

✍ C. Benzaken 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 689 KB

In the Post lattice of the families of closed systems (r.e. sets CT ooolean functions closed with respect to composition) the particular systems of mionotonic functions are closely related to the classitication of hypergraphs by their weak chromatic numbers. It is shown also that ffor k r 3, the k-c

A conjecture on small embeddings of part

A conjecture on small embeddings of partial Steiner triple systems

✍ Darryn Bryant 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB 👁 1 views

## Abstract A well‐known, and unresolved, conjecture states that every partial Steiner triple system of order __u__ can be embedded in a Steiner triple system of order υ for all υ ≡ 1 or 3, (mod 6), υ ≥ 2u + 1. However, some partial Steiner triple systems of order __u__ can be embedded in Steiner t

A proof of Lindner's conjecture on embed

A proof of Lindner's conjecture on embeddings of partial Steiner triple systems

✍ Darryn Bryant; Daniel Horsley 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 1 views

## Abstract Lindner's conjecture that any partial Steiner triple system of order __u__ can be embedded in a Steiner triple system of order __v__ if $v\equiv 1,3 \; ({\rm mod}\; 6)$ and $v\geq 2u+1$ is proved. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 63–89, 2009