41 reputation
1
bio website
location
age
visits member for 4 years, 3 months
seen Dec 12 '10 at 10:35

Aug
1
comment Lower bounds for chromatic number of a graph
In this article, table 4, optimization-online.org/DB_HTML/2010/03/2568.html there are results for a time bound of 3600 seconds. Whether the fractional chromatic number problem for a graph of 560 vertices can be solved within this time bound depends on the type of graph. From the table it seems that denser graphs are more likely to be solved earlier.
Jul
30
awarded  Teacher
Jul
30
answered Lower bounds for chromatic number of a graph