Extending the Gyárfás-Sumner conjecture


Say a set H of graphs is heroic if there exists k such that every graph containing no member of H as an induced subgraph has cochromatic number at most k. (The cochromatic number of G is the minimum number of stable sets and cliques with union V (G).) Assuming an old conjecture of Gyárfás and Sumner, we give a complete characterization of the finite heroic… (More)
DOI: 10.1016/j.jctb.2013.11.002


  • Presentations referencing similar topics