58 citations · 549 across the 45 of their papers we have counts for
4 papers · 2 filters
Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
József Balogh, Ping Hu, Bernard Lidický +1
Let denote the maximum number of induced copies of 5-cycles in graphs on vertices. For large enough, we show that $C(n)=a\cdot b\cdot c \cdot d \cdot e + C(a)+C(b)+C…
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…
Crossing numbers of complete tripartite and balanced complete multipartite graphs
Ellen Gethner, Leslie Hogben, Bernard Lidický +3
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number…
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…