Petersen coloring conjecture
Let denote the Petersen graph, i.e. the graph whose vertex set is the collection of all -element subsets of , two such subsets being joined by an edge if and only if they are disjoint; has vertices and edges.
For a finite graph (multiple edges and loops permitted), call a set a cycle of if every vertex of is incident with an even number of edges of (loops counted twice); equivalently, the cycles of are exactly the elements of the cycle space of over , i.e. the edge sets of the Eulerian subgraphs of .
Given graphs and , a map is cycle-continuous if for every cycle of the preimage
is a cycle of .
Then: for every finite bridgeless graph there exists a cycle-continuous map .
Equivalent formulations
In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring.
source: Wikipedia
References
- Wikipedia, Petersen graph, the article this problem comes from.
Source: Wikipedia
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.