![](/files/happy5.png)
Thomas, Robin
Does every subcubic triangle-free graph have fractional chromatic number at most 14/5? ★
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
, that every sufficiently large
-connected graph without a
minor has a set of
vertices whose deletion results in a planar graph?
![$ n \ge 0 $](/files/tex/90df48fa9e1e2158a5da469f1fb382d91bf47483.png)
![$ n $](/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png)
![$ K_n $](/files/tex/3047d5de14f4534bc7c4d3e1d86c3fb292aea727.png)
![$ n-5 $](/files/tex/9ed6ca429bf7a035c85bba441d0e1299c0af67dc.png)
Keywords: connectivity; minor
![Syndicate content Syndicate content](/misc/feed.png)