5 citations · 21 across the 17 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
On the query complexity of estimating the distance to hereditary graph properties
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang +2
Given a family of graphs , we prove that the normalized edit distance of any given graph to being induced -free is estimable with a query complexity t…
math.CO2019
Minimum degree conditions for monochromatic cycle partitioning
Dániel Korándi, Richard Lang, Shoham Letzter +1
A classical result of Erdős, Gyárfás and Pyber states that any -edge-coloured complete graph has a partition into monochromatic cycles. Here we determine the min…