35 citations · 35 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023
Embedded graph 3-coloring and flows
Caroline Bang, Zdeněk Dvořák, Emily Heath +1
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between color…
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.CO2012
On the Turan number of forests
Bernard Lidický, Hong Liu, Cory Palmer
The Turan number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turan number and find the uniq…