3 papers
math.CO2022
Uniform Turán density of cycles
Matija Bucić, Jacob W. Cooper, Daniel Kráľ +2
In the early 1980s, Erdős and Sós initiated the study of the classical Turán problem with a uniformity condition: the uniform Turán density of a hypergraph is the infimum over…
math.CO2020
Quasirandom Latin squares
Jacob W. Cooper, Daniel Kral, Ander Lamaison +1
We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is…
math.CO2020
Hadwiger meets Cayley
Jacob W. Cooper, Adam Kabela, Daniel Král' +1
We show that every connected -chromatic graph contains at least spanning trees.