✦ LIBER ✦

On the chromatic number of finite systems of subsets

✍ Scribed by D. A. Shabanov

Book ID: 110149550
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 389 KB
Volume: 85
Category: Article
ISSN: 0001-4346
DOI: 10.1134/s0001434609050332

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On chromatic number of finite set-system

On chromatic number of finite set-systems

✍ L. Lovász 📂 Article 📅 1968 🏛 Akadmiai Kiad 🌐 English ⚖ 555 KB

On the Chromatic Number of Subsets of th

On the Chromatic Number of Subsets of the Euclidean Plane

✍ M. Axenovich, J. Choi, M. Lastrina, T. McKay, J. Smith… 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 419 KB

On the finiteness of the recursive chrom

On the finiteness of the recursive chromatic number

✍ William I. Gasarch; Andrew C.Y. Lee 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 559 KB

A recursive graph is a graph whose vertex and edge sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively determine the neighbors of a vertex. Both of these have been studied in the literature. We consider an intermediary notion:

Upper chromatic number of finite project

Upper chromatic number of finite projective planes

✍ Gábor Bacsó; Zsolt Tuza 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## Abstract For a finite projective plane $\Pi$, let $\bar {\chi} (\Pi)$ denote the maximum number of classes in a partition of the point set, such that each line has at least two points in the same partition class. We prove that the best possible general estimate in terms of the order of projectiv

On the Number of Linearly Separable Subs

On the Number of Linearly Separable Subsets of Finite Sets inRn

✍ T. Gulliksen; A. Hole 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 115 KB

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.