Open Problem Garden
Help
About
Contact
login/create account
Home
ยป
Does every subcubic triangle-free graph have fractional chromatic number at most 14/5?
This conjecture has recently
On March 2nd, 2013
fhavet
says:
This conjecture has recently been proved by Dvorak, Sereni and Volec.
Frederic Havet
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
This conjecture has recently
This conjecture has recently been proved by Dvorak, Sereni and Volec.
Frederic Havet