𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On chromatic number of finite set-systems

✍ Scribed by L. Lovász

Publisher
Akadmiai Kiad
Year
1968
Tongue
English
Weight
555 KB
Volume
19
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Chromatic number of finite and infinite
Chromatic number of finite and infinite graphs and hypergraphs
✍ Paul Erdös; Andras Hajnal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 349 KB

We wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and Szemer6di, and posed many problems some of which turned out to be undecidable. In this survey we state some old and new solved and unsolved problems. Nous avons 6crit beaucoup d'articles, certains en collabo