1 citations · 1 across the 1 of their papers we have counts for
3 papers
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…
math.CO2017★ 1 cited
On the Turán number of ordered forests
Dániel Korándi, Gábor Tardos, István Tomon +1
An ordered graph is a simple graph with a linear order on its vertex set. The corresponding Turán problem, first studied by Pach and Tardos, asks for the maximum number $\text{…