Fractional colorings of cubic graphs with large girth

Details Fractional colorings of cubic graphs with large girth Fractional colorings of cubic graphs with large girth

2010-10-17

arxiv.org/abs/1010.3415v1

Mathematics

Combinatorics

Scientific paper

We show that every (sub)cubic n-vertex graph with sufficiently large girth
has fractional chromatic number at most 2.2978 which implies that it contains
an independent set of size at least 0.4352n. Our bound on the independence
number is valid to random cubic graphs as well as it improves existing lower
bounds on the maximum cut in cubic graphs with large girth.

Affiliated with

Also associated with

No associations

Rating

Fractional colorings of cubic graphs with large girth 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 Fractional colorings of cubic graphs with large girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fractional colorings of cubic graphs with large girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-10464