On graphs with a large chromatic number that contain no small odd cycles

Autor:	I. I. Bogdanov, S. L. Berlov
Rok vydání:	2012
Předmět:	Statistics and Probability Combinatorics Applied Mathematics General Mathematics Chromatic scale Graph Mathematics
Zdroj:	Journal of Mathematical Sciences. 184:573-578
ISSN:	1573-8795 1072-3374
DOI:	10.1007/s10958-012-0882-4
Popis:	In this paper, we present lower bounds for the number of vertices in a graph with a large chromatic number that does not contain small odd cycles. Bibliographyy 6 titles.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7dfe0969153b87e656b667e30e516e52 https://doi.org/10.1007/s10958-012-0882-4 Zobrazit plný text záznamu Plný text ve formátu PDF