10 citations · 21 across the 8 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Large homogeneous submatrices
Dániel Korándi, János Pach, István Tomon
A matrix is homogeneous if all of its entries are equal. Let be a zero-one matrix that is not homogeneous. We prove that if an zero-one matrix does…
math.CO2019
Covering graphs by monochromatic trees and Helly-type results for hypergraphs
Matija Bucić, Dániel Korándi, Benny Sudakov
How many monochromatic paths, cycles or general trees does one need to cover all vertices of a given -edge-coloured graph ? These problems were introduced in the 1960s and we…