Mathematics – Combinatorics
Scientific paper
2011-01-24
Mathematics
Combinatorics
17 pages, 5 figures, 1 table
Scientific paper
We construct dense, triangle-free, chromatic-critical graphs of chromatic number k for all k>/-4. For k>/-6 our constructions have >(1/4-{\espilon})n^2 edges, which is asymptotically best possible by Tur\'an's theorem. We also demonstrate (nonconstructively) the existence of dense pentagon-and-triangle-free k-critical graphs for any k>/-4, again with a best possible density of >(1/4-{\espilon})n^2 edges for k>/-6. The families of triangle-free and pentagon-and-triangle-free graphs are thus rare examples where we know the correct maximal density of k-critical members (k>/-6). We also construct dense 4-critical graphs of any odd-girth.
No associations
LandOfFree
Critical graphs without triangles: an optimum density construction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Critical graphs without triangles: an optimum density construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical graphs without triangles: an optimum density construction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-635524