2 citations · 3 across the 11 of their papers we have counts for
11 papers
Maximizing in graphs with fixed edge density
József Balogh, Andrzej Grzesik, Bernard Lidický +3
For every integer , and , we asymptotically determine the maximum proportion of -element sets of vertices that induce either a clique or an independent set in…
Local maximum of inducibility profiles
József Balogh, Bernard Lidický, Haoran Luo
For a graph and , denote by the supremum of induced density of over -vertex graphs with edge density as goes to infinity. Liu, Mubayi and Re…
Sidorenko property and forcing in regular tournaments
Daniel Král', Matjaž Krnc, Filip Kučerák +2
We give a complete characterization of tournaments H that have the Sidorenko property with respect to nearly regular tournaments, i.e., the homomorphism density of H among all near…
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…
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…
Positive co-degree densities and jumps
József Balogh, Anastasia Halfpap, Bernard Lidický +1
The minimum positive co-degree of a nonempty -graph , denoted by , is the largest integer such that for every -set , if is contai…
Small Ramsey numbers for books, wheels, and generalizations
Bernard Lidický, Gwen McKinley, Florian Pfender +1
In this work, we give several new upper and lower bounds on Ramsey numbers for books and wheels, including a tight upper bound establishing , matching upper and l…