| Article ID: | iaor2006942 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 4 |
| Start Page Number: | 385 |
| End Page Number: | 388 |
| Publication Date: | Jul 2005 |
| Journal: | Operations Research Letters |
| Authors: | Reed Bruce, Avis David, Simone Caterina De |
Jenson and Toft conjectured that for a graph with an even number of vertices, either the minimum number of colors in a proper edge colouring is equal to the maximum vertex degree, or this is true in its complement. We prove a fractional version of this conjecture.