𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Irregular embeddings of hypergraphs with fixed chromatic number

✍ Scribed by Michael S. Jacobson; Jenö Lehel

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
277 KB
Volume
145
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Irregular embeddings of multigraphs with
Irregular embeddings of multigraphs with fixed chromatic number
✍ Michael S. Jacobson; Jenö Lehel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Let G be a c-chromatic multigraph (c >t 2) with maximum edge multiplicity s. In this note we show that G has an embedding as an induced subgraph, into some degree irregular c-chromatic multigraph having the same maximum edge multiplicity.

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

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,\* ............ .

Chromatic numbers of hypergraphs and cov
Chromatic numbers of hypergraphs and coverings of graphs
✍ Zevi Miller; Heinrich Müller 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

Burr recently proved [3] that for positive integers m , , m 2 , . . , , m, and any graph G we have x(G) 5 &, if and only if G can be expressed as the edge disjoint union of subgraphs F, satisfying x(F,) 5 m,. This theorem is generalized to hypergraphs. By suitable interpretations the generalization

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

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