2 citations · 3 across the 11 of their papers we have counts for
4 papers · 2 filters
Density of rainbow triangles and properly colored 's
József Balogh, Peter Bradshaw, Ramon I. Garcia +1
We establish a sharp upper bound on the number of properly -edge-colored 's in graphs with red, green and blue edges. We give a computer-free flag-algebra proof…
On Relative Ordered Turán Density
Dylan King, Bernard Lidický, Minghui Ouyang +3
For an ordered graph , denote the Turán density by . The relative Turán density, denoted by , is the supremum over such that every ordered graph …
On a conjecture concerning 4-coloring of graphs with one crossing
Zdeněk Dvořák, Bernard Lidický, Bojan Mohar
We conjecture that every graph of minimum degree five with no separating triangles and drawn in the plane with one crossing is 4-colorable. In this paper, we use computer enumerati…
Flow-critical graphs
Arnbjörg Soffía Árnadóttir, Zdeněk Dvořák, Bernard Lidický +3
Lovász et al. proved that every -edge-connected graph has a nowhere-zero -flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3…