✦ LIBER ✦

On the Borsuk and Erdös—Hadwiger numbers

✍ Scribed by A. M. Raigorodskii

Book ID: 106456723
Publisher: SP MAIK Nauka/Interperiodica
Year: 2006
Tongue: English
Weight: 186 KB
Volume: 79
Category: Article
ISSN: 0001-4346
DOI: 10.1007/s11006-006-0096-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On independence numbers of distance grap

On independence numbers of distance graphs with vertices in {-1,0,1}n: estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger problem and the Borsuk problem

✍ A. E. Guterman; V. K. Lyubimov; A. M. Raigorodskii; S. A. Usachev 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 274 KB

On a series of problems related to the B

On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems

✍ A. M. Raigorodskii; M. M. Kityaev 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 749 KB

Hoffman's Erdös is number one

✍ Rust, Jes; Stumpner, Andreas; Gottwald, Jochen 📂 Article 📅 1999 🏛 Nature Publishing Group 🌐 English ⚖ 60 KB

On the Hadwiger numbers of starlike disk

On the Hadwiger numbers of starlike disks

✍ Zsolt Lángi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 393 KB

On a relationship between Hadwiger and s

On a relationship between Hadwiger and stability numbers

✍ F Maffray; H Meyniel 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 218 KB

On Hadwiger's number— a problem of the N

On Hadwiger's number— a problem of the Nordhaus-Gaddum type

✍ M. Stiebitz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Stiebitz, M., On Hadwiger's number-A problem of the Nordhaus-Gaddum type, Discrete Mathematics 101 (1992) 307-317. The Hadwiger number of a graph G = (V, E), denoted by q(G), is the maximum size of a complete graph to which G can be contracted. Let %((n, k):= {G 1 IV(G)1 = n and n(G) = k}. We shall