Triangle-free graphs with large chromatic numbers

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

It is shown that there are two positive constants c1, c2 such that the maximum possible chromatic number of a triangle-free graph with m > 1 edges is at most c1m1/3/(log m)2/3 and at least c2m1/3/(log m)2/3. This is deduced from results of Ajtai, Komlós, Szemerédi, Kim and Johansson, and settles a problem of Erdös. © 2000 Elsevier Science B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Nilli, A. (2000). Triangle-free graphs with large chromatic numbers. Discrete Mathematics, 211(1–3), 261–262. https://doi.org/10.1016/S0012-365X(99)00109-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free