
Conjecture If in a bridgeless cubic graph
the cycles of any
-factor are odd, then
, where
denotes the oddness of the graph
, that is, the minimum number of odd cycles in a
-factor of
.







Recomm. for undergrads: no |
Posted | by: | Gagik |
on: | January 15th, 2010 |