Open Problem Garden
Help
About
Contact
login/create account
Home
ยป
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Modifying the conjecture
On May 16th, 2020 Anonymous says:
From Reed's conjecture, it seems that the ceiling has to be replaced by flooring. Thanks.
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
Modifying the conjecture
From Reed's conjecture, it seems that the ceiling has to be replaced by flooring. Thanks.