From the 1 of 10 linked papers with an AI index.
9 papers · 1 filter
Sidorenko property and forcing in regular tournaments
Daniel Král', Matjaž Krnc, Filip KuÄerák +2
The paper fully characterizes which tournaments have the Sidorenko property for nearly regular tournaments, showing that a random tournament minimizes homomorphism density, and res…
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…
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…
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 $…
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 re…
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 grap…