• Counterexamples to a Conjecture of Harris on Hall Ratio 

      Autor: Blumenthal A.; Lidický B.; Martin R.R.; Norin S.; Pfender F.; Volec J.
      (SIAM, 2022)
      In this work, we refute a conjecture of Harris by constructing various graphs whose fractional chromatic number grows much faster than their Hall ratio. The Hall ratio of a graph G is the maximum value of the ratio between ...
    • Sharp bounds for decomposing graphs into edges and triangles 

      Autor: Blumenthal A.; Lidický B.; Pehova Y.; Pfender F.; Pikhurko O.; Volec J.
      (Cambridge University Press, 2021)
      In 1966, Erdos, Goodman and Posa proved that the edges of an n-vertex graph can be decomposed into at most n^2/4 cliques. Moreover, such a decomposition may consist of edges and triangles only. In 1980s, Gyori and Kostochka ...