3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Let $F$ be a finite graph with at least one edge, and let $W$ be a graphon. We show that if the density of $F$ rooted at each edge is almost everywhere constant, then either $t(F,W)=0$ or $W$ is constant. For edge-transitive $F$, one rooted equation suffices. This recovers the edge-rooted triangle theorem of Reiher and...
We study minimum degree conditions for tight Hamiltonian cycles in uniformly dense $3$-uniform hypergraphs. We prove that for every $d,\alpha>0$, every sufficiently large $(\rho,d)$-dense $3$-graph on $n$ vertices with minimum codegree at least $(1/3+\alpha)n$ contains a tight Hamiltonian cycle. This resolves a problem...
For an $n$-dimensional convex body $K$, let $\theta_L(K)$ denote its lattice covering density, and let $\Theta_L^{\mathrm{conv}}(n)$ and $\Theta_L^{\mathrm{sym}}(n)$ be the corresponding worst-case quantities over all convex bodies and over origin-symmetric convex bodies, respectively. Before this work, these quantitie...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
