2 citations · 2 across the 4 of their papers we have counts for
8 papers
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…
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…
Hadwiger meets Cayley
Jacob W. Cooper, Adam Kabela, Daniel Král' +1
We show that every connected -chromatic graph contains at least spanning trees.
Packing and covering directed triangles asymptotically
Jacob W. Cooper, Andrzej Grzesik, Adam Kabela +1
A well-known conjecture of Tuza asserts that if a graph has at most pairwise edge-disjoint triangles, then it can be made triangle-free by removing at most edges. If true,…
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecky +2
A long line of research on fixed parameter tractability of integer programming culminated with showing that integer programs with n variables and a constraint matrix with dual tree…
Finitely forcible graph limits are universal
Jacob W. Cooper, Daniel Kral, Taisa L. Martins
The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely…
Optimal-size clique transversals in chordal graphs
Jacob W. Cooper, Andrzej Grzesik, Daniel Kral
The following question was raised by Tuza in 1990 and Erdos et al. in 1992: if every edge of an n-vertex chordal graph G is contained in a clique of size at least four, does G have…
Weak regularity and finitely forcible graph limits
Jacob W. Cooper, Tomas Kaiser, Daniel Kral +1
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determine…