r-chromatic simple graph with no cycle of < =6 edges
Source: Danube 2013 p3
July 22, 2019
graph theorygraphgraph cyclescombinatorics
Problem Statement
Show that, for every integer , there exists an -chromatic simple graph (no loops, nor multiple edges) which has no cycle of less than edges