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

Frédéric Meunier

doi:10.1002/jgt.20079

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

Frédéric Meunier

Laboratoire Leibniz-IMAG

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	257-261
Number of pages	5
Journal	Journal of Graph Theory
Volume	49
Issue number	4
DOIs	https://doi.org/10.1002/jgt.20079
Publication status	Published - 1 Jan 2005
Externally published	Yes

Keywords

Circular chromatic number
Fan's theorem
Kneser graphs
Topological methods

Access to Document

10.1002/jgt.20079

Cite this

@article{d2c20818afd04bc3ad155daa20db08e9,

title = "A topological lower bound for the circular chromatic number of schrijver graphs",

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.",

keywords = "Circular chromatic number, Fan's theorem, Kneser graphs, Topological methods",

author = "Fr{\'e}d{\'e}ric Meunier",

year = "2005",

month = jan,

day = "1",

doi = "10.1002/jgt.20079",

language = "English",

volume = "49",

pages = "257--261",

journal = "Journal of Graph Theory",

issn = "0364-9024",

number = "4",

}

TY - JOUR

T1 - A topological lower bound for the circular chromatic number of schrijver graphs

AU - Meunier, Frédéric

PY - 2005/1/1

Y1 - 2005/1/1

N2 - 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.

AB - 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.

KW - Circular chromatic number

KW - Fan's theorem

KW - Kneser graphs

KW - Topological methods

UR - https://www.scopus.com/pages/publications/24144476933

U2 - 10.1002/jgt.20079

DO - 10.1002/jgt.20079

M3 - Article

AN - SCOPUS:24144476933

SN - 0364-9024

VL - 49

SP - 257

EP - 261

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 4

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this