35 citations · 160 across the 27 of their papers we have counts for
Showing 2014 · math.COShow all
3 papers · 2 filters
math.CO2014★ 35 cited
Minimum number of monotone subsequences of length 4 in permutations
József Balogh, Ping Hu, Bernard Lidický +3
We show that for every sufficiently large , the number of monotone subsequences of length four in a permutation on points is at least $\binom{\lfloor n/3 \rfloor}{4} + \bino…
math.CO2014★ 32 cited
Rainbow triangles in three-colored graphs
Jozsef Balogh, Ping Hu, Bernard Lidicky +3
Erdos and Sos proposed a problem of determining the maximum number F(n) of rainbow triangles in 3-edge-colored complete graphs on n vertices. They conjectured that F(n) = F(a)+ F(b…
math.CO2014
Fractional coloring of triangle-free planar graphs
Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec
We prove that every planar triangle-free graph on vertices has fractional chromatic number at most .