Color-Critical Graphs Have Logarithmic Circumference

Details Color-Critical Graphs Have Logarithmic Circumference Color-Critical Graphs Have Logarithmic Circumference

2009-08-21

arxiv.org/abs/0908.3169v2

Mathematics

Combinatorics

Scientific paper

A graph G is k-critical if every proper subgraph of G is (k-1)-colorable, but the graph G itself is not. We prove that every k-critical graph on n vertices has a cycle of length at least log n/(100log k), improving a bound of Alon, Krivelevich and Seymour from 2000. Examples of Gallai from 1963 show that the bound cannot be improved to exceed 2(k-1)log n/log(k-2). We thus settle the problem of bounding the minimal circumference of k-critical graphs, raised by Dirac in 1952 and Kelly and Kelly in 1954.

Affiliated with

Also associated with

No associations

Rating

Color-Critical Graphs Have Logarithmic Circumference 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 Color-Critical Graphs Have Logarithmic Circumference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Color-Critical Graphs Have Logarithmic Circumference will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-667011