From the 1 of 4 linked papers with an AI index.
4 papers
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…
Fundamental cycles in grid graphs
BartÅomiej Kielak, Bartłomiej Kielak, Daniel Král' +3
We show that the average length of a fundamental cycle with respect to any fixed spanning tree of the square grid is at least ; the bound is asymptotically t…
Convergence of spectra of digraph limits
Jan GrebÃk, Daniel Král', Xizhi Liu +2
The relation between densities of cycles and the spectrum of a graphon, which implies that the spectra of convergent graphons converge, fundamentally relies on the self-adjointness…
Uniform Turán density -- palette classification
Daniel Král', Filip KuÄerák, Ander Lamaison +1
In the 1980s, ErdÅs and Sós initiated the study of Turán hypergraph problems with a uniformity condition on the distribution of edges, i.e., determining density thresholds for t…