✦ LIBER ✦

New Bounds on the Katchalski—Lewis Transversal Problem

✍ Scribed by Holmsen

Publisher: Springer
Year: 2003
Tongue: English
Weight: 112 KB
Volume: 29
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-002-0755-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Katchalski-Lewis Transversal Problem

The Katchalski-Lewis Transversal Problem in Rn

✍ Andreas Holmsen 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 177 KB

Proof of the Katchalski-Lewis Transversa

Proof of the Katchalski-Lewis Transversal Conjecture for T(3)-Families of Congruent Discs

✍ Aladar Heppes 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 313 KB

Lower Bounds on the Transversal Numbers

Lower Bounds on the Transversal Numbers ofd-Intervals

✍ J. Matoušek 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 46 KB

Bounds on the clique-transversal number

Bounds on the clique-transversal number of regular graphs

✍ ErFang Shan; T. C. E. Cheng; LiYing Kang 📂 Article 📅 2008 🏛 SP Science China Press 🌐 English ⚖ 455 KB

New bounds on a hypercube coloring probl

New bounds on a hypercube coloring problem

✍ Hung Quang Ngo; Ding-Zhu Du; Ronald L. Graham 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 57 KB

In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of χ k (n), the minimum number of

New bounds for the controller problem

✍ Yuval Emek; Amos Korman 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 331 KB