Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

A snark is a graph that is connected, regular of degree 3, bridgeless, but has edge chromatic number 4. The fractional edge chromatic number is therefore between 3 and 4. I have checked several and all cases have fractional edge chromatic number 3. So: Is it the case that all snarks have fractional edge chromatic number 3?

Stan Wagon

share|improve this question
add comment

1 Answer

up vote 1 down vote accepted

$\chi_f(G)$ = $\max (\Delta (G), \Lambda (G))$, where $\Lambda (G)$ = $\max_H \frac{2\epsilon(H)}{\nu(H) − 1}$ where the maximization is over all induced subgraphs $H$ with $\nu(H) ≥ 3$ and odd. For Snarks, $\Lambda (G) \leq 3$. For more details check the chapter on edge coloring in Fractional Graph Theory.

share|improve this answer
Excellent. Many thanks. –  stan wagon May 28 '12 at 14:44
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.