✦ LIBER ✦

New combinatorial topology bounds for renaming: the lower bound

✍ Scribed by Armando Castañeda; Sergio Rajsbaum

Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 878 KB
Volume: 22
Category: Article
ISSN: 0178-2770
DOI: 10.1007/s00446-010-0108-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for combinatorial problems

Lower bounds for combinatorial problems on graphs

✍ Hiroyuki Nakayama; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Combinatorial lower bounds for secret sh

Combinatorial lower bounds for secret sharing schemes

✍ Kaoru Kurosawa; Koji Okada 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 286 KB

In a perfect secret sharing scheme, it holds that log, I%[ > H(S), where S denotes the secret and G denotes the set of the share of user i. On the other hand, it is well known that log213 > H(S) if S is not uniformly distributed, where ? denotes the set of secrets. In this case, log, @I > H(S) < log

A New Lower Bound Theorem for Combinator

A New Lower Bound Theorem for Combinatorial 2k-Manifolds

✍ Eric Sparla 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 232 KB

A lower bound for the topological comple

A lower bound for the topological complexity of poly(D,n)

✍ Harold Levine 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 646 KB

An Upper and a Lower Bound Theorem for C

An Upper and a Lower Bound Theorem for Combinatorial 4-Manifolds

✍ E. Sparla 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 222 KB

A topological lower bound for the circul

A topological lower bound for the circular chromatic number of Schrijver graphs

✍ Meunier, Frédéric (author) 📂 Article 📅 2005 🏛 Wiley-Liss Inc. 🌐 English ⚖ 66 KB 👁 1 views

## Abstract In this paper, we prove that the Kneser graphs defined on a ground set of __n__ elements, where __n__ is even, have their circular chromatic numbers equal to their chromatic numbers. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005