✦ LIBER ✦

On The Chromatic Number of Geometric Hypergraphs

✍ Scribed by Smorodinsky, Shakhar

Book ID: 118196913
Publisher: Society for Industrial and Applied Mathematics
Year: 2007
Tongue: English
Weight: 184 KB
Volume: 21
Category: Article
ISSN: 0895-4801
DOI: 10.1137/050642368

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The circular chromatic number of hypergr

The circular chromatic number of hypergraphs

✍ Richard C. Brewster; Gary MacGillivray; Laura Shepherd 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 556 KB

The chromatic numbers of random hypergra

The chromatic numbers of random hypergraphs

✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

For a pair of integers 1 F ␥r, the ␥-chromatic number of an r-uniform Ž . hypergraph H s V, E is the minimal k, for which there exists a partition of V into subsets < < T, . . . , T such that e l T F ␥ for every e g E. In this paper we determine the asymptotic 1 k i Ž . behavior of the ␥-chromatic n

On the chromatic number and independence

On the chromatic number and independence number of hypergraph products

✍ Dhruv Mubayi; Vojtěch Rödl 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 106 KB

Critical hypergraphs for the weak chroma

Critical hypergraphs for the weak chromatic number

✍ C Benzaken 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 732 KB

On the chromatic number of random geomet

On the chromatic number of random geometric graphs

✍ Colin Mcdiarmid; Tobias Müller 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 684 KB

Strong total chromatic numbers of comple

Strong total chromatic numbers of complete hypergraphs

✍ Peter Cowling 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We determine the strong total chromatic number of the complete h-uniform hypergraph Kh, and the complete h-partite hypergraph K,\* ............ .