𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower Bounds on Strip Discrepancy for Nonatomic Colorings

✍ Scribed by Allen D. Rogers

Publisher
Springer Vienna
Year
2000
Tongue
English
Weight
183 KB
Volume
130
Category
Article
ISSN
0026-9255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bounds for on-line graph coloring
Lower bounds for on-line graph coloring
✍ Magnus M. HalldΓ³rsson; Mario Szegedy πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 771 KB
A lower bound for partial list colorings
A lower bound for partial list colorings
✍ Chappell, Glenn G. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 2 views

Let G be an n-vertex graph with list-chromatic number Ο‡ . Suppose that each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas [1] conjecture that at least t n /Ο‡ vertices can be colored from these lists. We prove a lower bound for the number of colorable vertices. As a coroll

Lower bounds for bi-colored quaternary r
Lower bounds for bi-colored quaternary ramsey numbers
✍ Aditya Shastri πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 180 KB

In this note, we prove that R(5, 5; 4) 2 19. We also compute lower bounds for some higher order numbers.