3 ms·

I'd like to know the best known lower bound on graph sizes that disprove the conjecture. Could there be graphs of just a few dozen nodes that disprove it? Has a

by tromp 7y ago

I'd like to know the best known lower bound on graph sizes that disprove the conjecture. Could there be graphs of just a few dozen nodes that disprove it? Has anyone tried to find a counterexample by brute force search?

sesuximo 7y ago
id bet yes
rowanG077 7y ago
it's NP-hard to determine the chromatic number of a graph. So I'd wager you wouldn't get far with a brute force approach.