|
Zapiski Nauchnykh Seminarov POMI, 2011, Volume 391, Pages 35–44
(Mi znsl4567)
|
|
|
|
On graphs with a large chromatic number containing no small odd cycles
S. L. Berlova, I. I. Bogdanovb a Physical and Mathematical Lyceum 239, St. Petersburg, Russia
b Moscow Institute of Physics and Technology, Dolgoprudnyi, Moscow reg., Russia
Abstract:
We present lower bounds for the number of vertices in a graph with a large chromatic number containing no small odd cycles.
Key words and phrases:
chromatic number, odd cycles, girth.
Received: 03.11.2011
Citation:
S. L. Berlov, I. I. Bogdanov, “On graphs with a large chromatic number containing no small odd cycles”, Combinatorics and graph theory. Part III, Zap. Nauchn. Sem. POMI, 391, POMI, St. Petersburg, 2011, 35–44; J. Math. Sci. (N. Y.), 184:5 (2012), 573–578
Linking options:
https://www.mathnet.ru/eng/znsl4567 https://www.mathnet.ru/eng/znsl/v391/p35
|
Statistics & downloads: |
Abstract page: | 274 | Full-text PDF : | 122 | References: | 37 |
|