4 papers
Semi-Inducibility of some small graphs
József Balogh, Bernard Lidický, Dhruv Mubayi +2
Let be a fixed graph whose edges are colored red and blue and let . Let be the (asymptotically normalized) maximum number of copies of in a large red/…
Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers
Daniel Brosch, Bernard Lidický, Sydney Miyasaki +1
In this paper, we investigate three extensions of Ramsey numbers to other combinatorial settings. We first consider ordered Ramsey numbers. Here, we ask for a monochromatic copy of…
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…