**Petersen Coloring Conjecture**

According to DeVos, Nesetril, and Raspaud, "A *cycle* of a graph G is a set C E(G) so that every vertex of the graph (V(G),C) has even degree. If G,H are graphs, we define a map φ: E(G) —> E(H) to be *cycle-continuous* if the pre-image of every cycle of H is a cycle of G. A fascinating conjecture of Jaeger asserts that every bridgeless graph has a cycle-continuous mapping to the Petersen graph. Jaeger showed that if this conjecture is true, then so is the 5-cycle-double-cover conjecture and the Berge-Fulkerson conjecture."

Read more about this topic: Petersen Graph

### Famous quotes containing the word conjecture:

“What these perplexities of my uncle Toby were,—’tis impossible for you to guess;Mif you could,—I should blush ... as an author; inasmuch as I set no small store by myself upon this very account, that my reader has never yet been able to guess at any thing. And ... if I thought you was able to form the least ... *conjecture* to yourself, of what was to come in the next page,—I would tear it out of my book.”

—Laurence Sterne (1713–1768)