Skip to content
Preprint

Forcing Quasirandomness via Rooted F-Densities

Aug 2026 · 0 citations · 30 references
Mathematics

Abstract

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 Schacht. In their terminology, our result also shows that every clique is $2$-forcing, answering a question they posed. We give an explicit stability estimate when $W$ is bounded away from zero. Our proof has two steps: an entropy argument turns constant rooted densities into an additive identity for $\log W$, and a Hoeffding decomposition determines all solutions of that identity. The same method gives exact classifications and quantitative stability estimates for symmetric uniform hyperkernels, dissociated Aldous--Hoover hypergraphons, directed kernels, and tournamentons.

View source

Similar papers

Preprint Oct 2026

Optimal Bounds on Spanning Tree Embeddings

We prove that the number of labelled embeddings of any $n$-vertex tree $T$ into an $n$-vertex graph $G$ of maximum degree $d$ satisfies $$ \mathrm{inj}(T,G) \leq (d/e)^n \exp(o_d(1) n). $$ The bound is sharp up to determining $o_d(1)$, even for paths, and the dependence of the error $\exp(o_d(1)n)$ on $d$ is necessary....

Csongor Beke, V. Boskovic, Nina Kamčev et al. · 0 citations
Preprint Sep 2026

Fractional clique decompositions in random hypergraphs

We prove that, whenever $ p \ge n^{-1/2 + o(1)} $, with high probability $ G(n, p) $ admits a fractional triangle decomposition, that is, a non-negative weight function on its triangles for which the total weight of all triangles containing each edge is equal to 1. This bound on $ p $ is optimal up to the asymptotic er...

Felix Joos, Zak Smith · 1 citation
Preprint Oct 2026

A finite threshold for the double-comet conjecture

For a tree $T$, let $g(T)=\lambda_1(T)-\lambda_2(T)$ be the difference between its two largest adjacency eigenvalues. A balanced double comet is obtained by attaching equally many leaves to the two endpoints of a path. Jovovi\'c, Koledin and Stani\'c conjectured that such a tree attains the minimum adjacency spectral g...

Dong-Xiu Cai, Zhen-Bo Chen, Xiao-Dong Zhang · 0 citations
Preprint Aug 2026

Structure theorems for Lichnerowicz-sharp graphs

Hypercube graphs are fundamental model spaces of positive curvature in discrete comparison geometry. Let $G$ be a finite, connected, simple, unweighted graph with Bakry--\'Emery curvature bounded below by $K$. We call $G$ Lichnerowicz-sharp if its first non-zero non-normalized Laplacian eigenvalue $\lambda_1=K$. We pro...

Yanlong Ding, Shiping Liu, Chiyu Zhou · 0 citations
Preprint Aug 2026

A reformulation of the discrete Convexity Conjecture via $k$-thresholds

We introduce the notion of"$k$-thresholds''and show that Talagrand's discrete convexity conjecture is equivalent to the assertion that, for some universal integer $k \ge 2$, the $k$-threshold of every increasing family is at most a universal constant times its expectation threshold. We prove a reduction theorem that bo...

Ruben Ascoli, Xiaoyu He, Jinyoung Park et al. · 5 citations · ⚡2
Preprint Aug 2026

Extremal graphs for a conjecture on the square energy of graphs

For a graph $G$, let $s^+(G)$ and $s^-(G)$ denote the sums of the squares of its positive and negative adjacency eigenvalues. We determine all equality cases in the conjecture of Elphick, Farber, Goldberg, and Wocjan that every connected graph $G$ on $n$ vertices satisfies \[ \min \{s^+(G),s^-(G)\}\ge n-1. \] Namely, e...

Fu-Tao Hu, Ya-Yang Liu, Yi Wang · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.