Open Problem Garden
Help
About
Contact
login/create account
Home
ยป
Three-chromatic (0,2)-graphs
Finite Three-Chromatic (0,2)-graphs
On February 6th, 2013 Anonymous says:
An infinite three-chromatic (0, 2)-graph is easy to construct. See Payan.
Reply
Are you a person?:
*
Subject:
Comment:
*
Comments are limited to a maximum of 1000 characters.
More information about formatting options
Navigate
Subject
Algebra
(295)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more
login/create account
Drupal
CSI of Charles University
Finite Three-Chromatic (0,2)-graphs
An infinite three-chromatic (0, 2)-graph is easy to construct. See Payan.