✦ LIBER ✦

Some coloring properties for uncountable cardinals

✍ Scribed by Pierre Matet

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 978 KB
Volume: 33
Category: Article
ISSN: 0168-0072
DOI: 10.1016/0168-0072(87)90085-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfect-set forcing for uncountable card

Perfect-set forcing for uncountable cardinals

✍ Akihiro Kanamori 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 905 KB

Some combinatorial properties of ineffab

Some combinatorial properties of ineffable cardinals

✍ Hongyu Zhang; Weijun Lin 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 232 KB

Some perfect coloring properties of grap

Some perfect coloring properties of graphs

✍ Claude A Christen; Stanley M Selkow 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 630 KB

Some remarks on a property of topologica

Some remarks on a property of topological cardinal functions

✍ A. Hajnal; I. Juhász 📂 Article 📅 1969 🏛 Akadmiai Kiad 🌐 English ⚖ 699 KB

Some cardinality questions for flat modu

Some cardinality questions for flat modules and coherence

✍ C.U. Jensen 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Some experiments with simulated annealin

Some experiments with simulated annealing for coloring graphs

✍ M. Chams; A. Hertz; D. de Werra 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 555 KB

Methods of thermodynamical simulation have been used for several famous combinatorial optimization problems. For graph coloring (i.e. partition of the node set into as few independent sets as possible) we describe a method of simulation. Such an approach is combined with other techniques for graph c