Thomas, Robin

Does every subcubic triangle-free graph have fractional chromatic number at most 14/5?

Author(s): Heckman; Thomas

Conjecture   Every triangle-free graph with maximum degree at most 3 has fractional chromatic number at most 14/5.

Keywords: fractional coloring

Highly connected graphs with no K_n minor ★★★

Author(s): Thomas

Problem   Is it true for all $ n \ge 0 $, that every sufficiently large $ n $-connected graph without a $ K_n $ minor has a set of $ n-5 $ vertices whose deletion results in a planar graph?

Keywords: connectivity; minor

Syndicate content