Searcharxiv⌕ Search

arXiv subjects

Yongtao Li

Publications and source records attributed to Yongtao Li.

At least 19 recordsLinked to original sources

Stabilities of the Kleitman diameter theorem

Let $\mathcal{F}$ be a family of subsets of $[n]$. The diameter of $\mathcal{F}$ is defined as the maximum size of the symmetric difference between any two of its members. Resolving a conjecture of Erdős, Kleitman determined the maximum size of a family with fixed diameter. Specifically, if $2\leq s\leq n-2$ and $\mathcal{F}\subseteq2^{[n]}$ is a family with diameter $s$, then for $s=2d$, $|\mathcal{F}|\le \sum_{i=0}^d {n \choose i}$; for $s=2d+1$, $|\mathcal{F}|\le \sum_{i=0}^d {n \choose i} + {n-1 \choose d}$. This result, known as the Kleitman diameter theorem, generalizes both the Katona union theorem and the Erdős--Ko--Rado theorem. In 2017, Frankl provided a complete characterization of the extremal families for Kleitman's theorem and established a stability result. In this paper, we determine the extremal families for Frankl's theorem and prove a further stability result of Kleitman's theorem. This solves a recent problem proposed by Li and Wu and provides the second stability for the Kleitman diameter theorem.

math.CO↗

Exact characterization of three-terminal fermion counting under one-body scattering

Quantum scattering is a fundamental probe of the scattering region and the quantum dynamics of outgoing particles. In two terminals, the statistics of non-interacting fermions is described by a generalized binomial distribution, that arises from the Pauli exclusion principle, while deviations are a signature of interactions. In this work, we extend this result to a scattering region coupled to three outgoing terminals (or channels), obtaining exact bounds for the statistics of the outgoing fermions. In particular, for two fermions and three terminals, four inequalities involving six measured probabilities determine whether a non-interacting scatterer can explain the observed statistics. Applying these inequalities to recent scattering experiments in cold atoms, we are able to identify a regime where interactions have a significant contribution on the outgoing particles. Therefore, our work opens up the possibility of identifying fermion interactions at the nanoscale in systems that range from mesoscopic conductors to optical traps in cold atoms.

cond-mat.mes-hall↗

Counting $K_4$-saturating non-edges in Nosal graphs

A non-edge of a $K_4$-free graph is $K_4$-saturating if adding it creates a copy of $K_4$, and $f(G)$ counts these non-edges. Erdős and Tuza showed that the minimum of $f$ over $n$-vertex $K_4$-free graphs jumps from zero to a quadratic quantity once the number of edges exceeds $\lfloor n^2/4\rfloor$. Balogh and Liu [J. Combin. Theory Ser. B 109 (2014)] determined the asymptotic size of this jump. In this paper, we study the jump phenomenon at Nosal's spectral threshold $λ(G)>\sqrt m$, where $λ(G)$ is the spectral radius and $m$ is the number of edges. This spectral threshold does not involve the order, and its boundary contains unbalanced graphs far below the Mantel threshold. We prove that every $K_4$-free graph $G$ with $λ(G)>\sqrt m$ satisfies $f(G)+ \frac{1}{2}q(G)> \frac{1}{9} λ(G)^2$, where $q(G)$ counts the vertices in triangles. The constant $\frac{1}{9}$ is best possible, and the triangle-free case of this inequality reduces to Nosal's theorem. Consequently, the minimum of $f$ over $K_4$-free graphs with $m$ edges jumps from $0$ to $\frac19m+O(\sqrt m\,)$ at the Nosal threshold, and the error order $\sqrt m$ is best possible. For large $λ(G)$, we also prove $f(G)>\frac19λ(G)^2-\frac13λ(G)$, and graphs on the boundary $λ(G)^2=m$ attain this value. In the extremal graphs, the three edges of every triangle have booksizes in the ratio $4:1:1$, so these graphs are different from those of Balogh and Liu. We also show that the spectral Mantel condition $λ(G)>λ(T_{n,2})$ forces asymptotically fewer $K_4$-saturating non-edges than the condition $e(G)>\lfloor n^2/4\rfloor$. Our proof transfers the Balogh-Liu theorem through a weighted blow-up and replaces the choice of an extremal edge by a zero-sum comparison over all edges of a neighborhood.

math.CO↗

The maximum degree of Nosal graphs

A graph $G$ with $m$ edges is a Nosal graph if its spectral radius $λ(G)$ exceeds $\sqrt m$. At the threshold $λ(G)=\sqrt m$, the star $K_{1,m}$ shows that one vertex can be incident with all $m$ edges. In contrast, Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026)] proved that every Nosal graph $G$ with sufficiently many edges satisfies $Δ(G)\le\frac12m+m^{0.99}$, where the constant $\frac12$ is best possible. In this paper, we prove that every Nosal graph $G$ with spectral radius $λ$ satisfies $Δ(G)<m-\frac12(λ-1)(λ-2)$, and hence $Δ(G)<\frac12m+\frac32\sqrt m-1$. Both bounds are sharp up to an additive constant less than $\frac12$: for every $r\ge3$, the complete graph $K_r$ with $\frac12(r^2+r-2)$ pendant vertices attached to one vertex is a Nosal graph with $r^2-1$ edges whose maximum degree lies within $\frac12$ of both bounds. Consequently, the largest maximum degree of a Nosal graph with $r^2-1$ edges is exactly $\frac12(r^2+3r-4)$. The first bound cannot be improved by any positive additive constant: its gap on these graphs is less than $\frac{4}{r+5}$ and tends to zero as $r\to \infty$.

math.CO↗

Fluctuation-free Quantum Battery Charging Enabled by Bell-like Entangled and Separable Charger States

The implication of entanglement in quantum battery charging remains poorly understood. In addition, intrinsic quantum randomness poses a fundamental challenge to charging uniformity across distinct trials. To address these issues, we study a three-qubit system within a cascaded collision frame, with two qubits acting as the charger and the third serving as the battery. After each collision, an adaptive measurement is performed on the charger, yielding four conditional post-measurement battery states with identical expected stored energy. For arbitrary fixed charger states, we derive analytical expressions for the recurrence relation of stored energy. We find that stored-energy fluctuations depend on whether the dynamics relies on the battery phase \(γ_n\). For two Bell-like families of entangled states, together with their computational basis states termed Bell-like separable states, the dynamics is \(γ_n\)-independent and fluctuations vanish, whereas for other entangled and separable states, fluctuations emerge. These insights establish a paradigm for engineering charger states to design uniform-charging quantum-battery architectures despite inherent quantum randomness.

quant-ph↗

An edge-spectral Erdős-Stone-Simonovits theorem and its stability

We study the extremal problem that relates the spectral radius $λ(G)$ of an $F$-free graph $G$ to its number of edges. Firstly, we prove that for any graph $F$ with chromatic number $χ(F)=r+1\ge 3$, if $G$ is an $F$-free graph with $m$ edges, then $λ^2(G)\le {(1-\frac{1}{r} + o(1))2m}$. This provides a unified extension of both the Erdős-Stone-Simonovits theorem and its vertex-spectral extension due to Nikiforov, and confirms a conjecture proposed by Li, Liu and Feng. We also establish the corresponding edge-spectral stability, showing that if $G$ is an $F$-free graph with $m$ edges with $λ^2(G) \ge (1- \frac{1}{r} - o(1))2m$, then $G$ differs from a complete bipartite graph by $o(m)$ edges when $r=2$, and $G$ differs from an $r$-partite Turán graph by $o(m)$ edges when $r\ge 3$. This extends both the classical Erdős-Simonovits stability and the Nikiforov vertex-spectral stability. This edge-spectral stability theorem is the key ingredient in our companion work on the Brualdi-Hoffman-Turán problem for color-critical forbidden graphs. As an application of our method, we improve a result of Zhai, Lin and Shu by showing that if $λ(G)>\sqrt{m}$, then there exist two vertices in $G$ that have at least $\frac{1}{2}\sqrt{m} - O(1)$ common neighbors. The constant $\frac{1}{2}$ is best possible as witnessed by a random construction.

math.CO↗

Optimal spectral supersaturation for cliques and odd cycles

Let $Y_{n,r,q}$ be the graph obtained from the Turán graph $T_{n,r}$ by adding $q$ pairwise disjoint edges inside a largest part, and let $c(n,F)$ be the minimum number of copies of $F$ created by adding a single edge to $T_{n,r}$. Fang, Li, Lin and Ma proved that for every color-critical graph $F$ with $χ(F)=r+1$, there exists a constant $δ_F>0$ such that for all sufficiently large $n$ and all $1\le q\le δ_F \sqrt{n}$, the condition $λ(G)\geλ(Y_{n,r,q})$ forces at least $q\, c(n,F)$ copies of $F$. The bound $q=O(\sqrt{n}\,)$ is tight up to a constant factor, in contrast to the linear order $n$ of the edge setting of Mubayi, Pikhurko and Yilma, but the exact constant $δ_F$ remained unknown for any $F$. In this paper, building on a structural result of Fang, Li, Lin and Ma, we determine the threshold $δ_F$ when $F$ is a clique and an odd cycle. For every $r\ge2$, we denote $δ_r :=(1-\tfrac1r)\sqrt2$ and prove that for every $\varepsilon>0$, if $n$ is sufficiently large and $1\le q\le(δ_r-\varepsilon)\sqrt n$, then every $n$-vertex graph $G$ with $λ(G)\geλ(Y_{n,r,q})$ contains at least $q\,c(n,K_{r+1})$ copies of $K_{r+1}$, and $δ_r$ is best possible. For odd cycles, the threshold is $1/\sqrt2$. For every $k\ge1$ and $\varepsilon>0$, if $n$ is sufficiently large and $1\le q\le(1/\sqrt2-\varepsilon)\sqrt n$, then every $n$-vertex graph $G$ with $λ(G)\geλ(Y_{n,2,q})$ contains at least $q\,c(n,C_{2k+1})$ copies of $C_{2k+1}$, and $1/\sqrt2$ is best possible. Our results determine both the exact count of copies and the optimal range of $q$. The behavior in the spectral setting differs from the classical edge setting, in which the range of $q$ is of order $n$ and the threshold is $1/r$ for cliques by Lovász and Simonovits, and $1/2$ for odd cycles by Pikhurko and Yilma.

math.CO↗

Achieving Identical Stored Energy in Cascaded Collisional Quantum Battery Charging: Analytical Result

Charging uniformity across distinct trials is an essential requirement for reliable quantum batteries. Nevertheless, intrinsic quantum stochasticity poses a fundamental challenge to this goal. This work investigates a two-qubit quantum battery within the framework of cascaded collision models. We propose an adaptive measurement on the charger after each collision, yielding two conditional battery states of equal expected stored energy. For chargers prepared in the excited state, we analytically prove that complete suppression of trajectory-dependent stored-energy fluctuations is attainable; for chargers prepared in general superposition states, our theory reveals that full suppression is fundamentally prohibited owing to battery-phase-dependent recursive dynamics. Numerical simulations are in excellent quantitative agreement with theoretical predictions. These findings provide a feasible pathway toward high-uniformity quantum-battery charging.

quant-ph↗

The spectral Erdős book theorem: sharp bounds and stability

The booksize $\mathrm{bk}(G)$ of a graph $G$ is the largest number of triangles sharing a common edge. A classical theorem of Edwards, conjectured by Bollobás and Erdős, states that every $n$-vertex graph $G$ with $e(G)>e(T_{n,2})$ has booksize greater than $n/6$. Zhai and Lin [J. Graph Theory 102 (2023) 502--520] asked whether the same conclusion holds under the spectral condition $λ(G)>λ(T_{n,2})$, where $λ(G)$ is the spectral radius of the adjacency matrix. We answer this question in a strong form: every $n$-vertex graph $G\neq T_{n,2}$ with $λ(G)\geλ(T_{n,2})$ satisfies \[ \mathrm{bk}(G)\ge\max\Big\{\frac13λ(G),\,λ(G)-\frac n3,\,2λ(G)-n\Big\}. \] Consequently, the condition $λ(G)>λ(T_{n,2})$ forces $\mathrm{bk}(G)\ge\lfloor n/6\rfloor+1$. The middle term is a spectral improvement of Edwards' bound $\mathrm{bk}(G)\ge\frac{2m}{n}-\frac n3$, and all three bounds are best possible. These results come from the edge-spectral setting: every graph $G$ with $m$ edges and $λ(G)\ge\sqrt m$ that is not a complete bipartite graph satisfies \[ \mathrm{bk}(G)\ge\max\Big\{λ(G)-\frac{2m}{3λ(G)},\,2λ(G)-\frac{2m}{λ(G)}\Big\}, \] which strengthens the bound $\mathrm{bk}(G)\ge\frac13λ(G)$ of Zhao, You, Zeng and Zhang. As an application of our method, we prove a triangle counting bound $t(G)\ge\frac13(λ(G)+1)(λ(G)^2-m)$, which improves the result of Bollobás and Nikiforov [J. Combin. Theory Ser B. (2007)]. Finally, we prove stability results at both thresholds: if $λ(G)\ge(\frac12-o(1))n$, then either $\mathrm{bk}(G)\ge(\frac16-o(1))n$ or $G$ can be made into $T_{n,2}$ by adding and deleting $o(n^2)$ edges; if $λ(G)\ge(1-o(1))\sqrt m$, then either $\mathrm{bk}(G)\ge(\frac13-o(1))\sqrt m$ or $G$ differs from a complete bipartite graph in $o(m)$ edges.

math.CO↗

Edge-spectral Turán theorems for color-critical graphs with applications

A classical result of Nosal asserts that every $m$-edge graph with spectral radius $λ(G)> \sqrt{m}$ contains a triangle. A celebrated extension of Nikiforov [2002, CPC] states that if $G$ is an $m$-edge graph with $λ(G)> \sqrt{(1- {1}/{r})2m}$, then $G$ contains a clique $K_{r+1}$. This result implies the Turán theorem and Wilf theorem, and offers a new perspective on the existence of substructures. The edge-spectral conditions are versatile for enforcing substructures, as they can be applied to any sparse graph regardless of its edge density. In this paper, we prove that for any color-critical graph $F$ with chromatic number $χ(F)=r+1\ge 4$, if $m$ is sufficiently large and $G$ is an $F$-free graph with $m$ edges, then $λ(G)\le \sqrt{(1- {1}/{r})2m}$, with equality if and only if $G$ is a regular complete $r$-partite graph. This settles an open problem proposed by Yu and Li [2025, arXiv] and also gives spectral bounds for graphs forbidding books and wheels. Secondly, we establish an asymptotic formula and structural characterization when we forbid an almost-bipartite graph $F$, where $F$ is called almost-bipartite if it can be made bipartite by removing at most one edge. As applications, we determine the unique $m$-edge spectral extremal graph for every integer $m$ when avoiding certain substructures, including complete bipartite graphs plus an edge, cycles plus an edge, and theta graphs, etc. Our results resolve an open problem proposed by Li, Zhao and Zou [2025, JGT], as well as two conjectures posed by Liu and Li [2025, LAA]. The arguments in our proofs are based on the edge-spectral stability method recently established by the authors. In addition, we develop some new spectral techniques, including the stability result for the Perron--Frobenius eigenvector.

math.CO↗

Chiral classical and quantum acoustics with hole-spin qubits

Gate-defined hole spins combine strong spin-orbit coupling with exceptional strain sensitivity, making surface acoustic waves a natural route to remote, phase-coherent control. We show that counterpropagating surface acoustic waves can differ in coupling strength and in whether they predominantly drive spin rotations or modulate the qubit frequency. We call the transverse transition-strength imbalance spin-acoustic chirality and show that it is tunable through gate-controlled reshaping of the dot confinement. Combining a multiband Luttinger-Kohn Hamiltonian with the Bir-Pikus description of strain and 3D piezoelectric finite-element simulations, we obtain the acoustic g-matrix modulation governing coherent SAW driving. Quantizing the same strain-mediated interaction yields the corresponding single-phonon coupling, and a generalized anisotropic Rabi interaction with co-rotating, counter-rotating, and longitudinal components, linking classical chirality to quantum anisotropy and directional one-phonon emission. Magnetic field orientation and dot shape tune the acoustic chirality and operator selectivity. We illustrate this framework through bichromatic coherence protection and phonon-mediated heralded Bell-state initialization.

cond-mat.mes-hall↗

An entropy bridge from weighted to spectral Turán theorems

We establish an entropy bridge, and then use it to prove that for any color-critical graph $F$ with chromatic number $χ(F)=r+1\ge 3$, there exists a constant $λ_0=λ_0(F)$ such that if $G$ is an $F$-free graph with $λ(G)\ge λ_0$, then for every $\ell\ge 1$ with $(r,\ell )\neq (2,2)$, \[ λ^\ell (G) \le \Big(1-\frac1r\Big)w_\ell(G), \] with equality if and only if $G$ is a regular complete $r$-partite graph; in the case $r=2$ with $\ell$ even, equality holds for every complete bipartite graph. The pair $(r,\ell )=(2,2)$ must be excluded, since the bound fails for several forbidden graphs, e.g., $C_{2t+1}$ with $t\ge 2$. Moreover, walks counts may also be replaced by the homomorphism counts of unbalanced trees. As further applications, we extend a spectral supersaturation result of Bollobás and Nikiforov [J. Combin. Theory Ser. B (2007)], and we also extend the entropic Turán theorem of Chao and Yu [J. London Math. Soc. (2026)] from $K_{r+1}$-free graphs to $F$-free graphs with $F$ color-critical. We provide a framework by passing through weighted Turá theorems of independent interest. If $G$ is $F$-free and $\mathbf{p}$ is a probability vector on $V(G)$ with $\lVert \mathbf{p}\rVert_\infty$ sufficiently small, then \[ 2\sum_{uv\in E(G)}p_up_v \le 1-\frac1r + o(1), \] and the error term $o(1)$ can be removed if and only if $F$ is color-critical. This is a Motzkin-Straus-type inequality in which the clique number of $G$ is replaced by $χ(F)-1$. The proof of this weighted result combines a blow-up argument, the graph removal lemma, the Erdős-Simonovits stability theorem, a probabilistic sampling argument, and an exact estimate near a complete $r$-partite graph. The bridge linking spectral inequalities to weighted inequalities is based on the entropy method for the Markov chain attached to the Perron vector.

math.CO↗

The product measures of cross $t$-intersecting families

We investigate the product measures of intersection problems in extremal combinatorics. Invoking a recent result of He--Li--Wu--Zhang, we prove that for any $ n \geq t \geq 3$ and $ p_1, p_2 \in (0, \frac{1}{t+1})$, if $ \mathcal{F}_1, \mathcal{F}_2 \subseteq 2^{[n]}$ are cross $ t$-intersecting families, then $μ_{p_1}(\mathcal{F}_1)μ_{p_2}(\mathcal{F}_2)\le (p_1p_2)^t$. Secondly, we study the intersection problems for integer sequences by proving that if $\mathcal{H}_1, \mathcal{H}_2 \subseteq [m]^{n}$ are cross $t$-intersecting with $ m > t+1$, then $|\mathcal{H}_1|| \mathcal{H}_2|\leq (m^{n-t})^2$. These results confirm two classical conjectures of Tokushige. As an application, we strengthen a recent theorem of Frankl--Kupavskii, generalizing the well-known IU-Theorem. Finally, we show that if $ p \geq \frac{1}{2}$ and $ \mathcal{F}_1, \mathcal{F}_2 \subseteq 2^{[n]}$ are cross $t$-intersecting families, then $\min \left\{μ_{p}(\mathcal{F}_1),μ_{p}(\mathcal{F}_2)\right\} \leq μ_{p}(\mathcal{K}(n,t))$, where $\mathcal{K}(n,t)$ denotes the Katona family. This recovers an old result of Ahlswede--Katona.

math.CO↗

Non-uniform pairwise cross $t$-intersecting families

Let $ n\geq t\geq 1$ and $ \mathcal{A}_1, \mathcal{A}_2, \ldots, \mathcal{A}_m \subseteq 2^{[n]}$ be non-empty families. We say that they are pairwise cross $t$-intersecting if $|A_i\cap A_j|\geq t$ holds for any $A_i\in \mathcal{A}_i$ and $A_j\in \mathcal{A}_j$ with $i\neq j$. In the case where $m=2$ and $\mathcal{A}_1=\mathcal{A}_2$, determining the maximum size $M(n,t)$ of a non-uniform $t$-intersecting family of sets over $[n]$ was solved by Katona (1964), and enhanced by Frankl (2017), and recently by Li and Wu (2024). In this paper, we establish the following upper bound: if $ \mathcal{A}_1, \mathcal{A}_2, \ldots, \mathcal{A}_m \subseteq 2^{[n]}$ are non-empty pairwise cross $t$-intersecting families, then $$ \sum_{i=1}^m |\mathcal{A}_i| \leq \max \left\{ \sum_{k=t} ^{n}\binom{n}{k} + m - 1, \, m M(n, t) \right\}. $$ Furthermore, we provide a complete characterization of the extremal families that achieve the bound. Our result not only generalizes an old result of Katona (1964) for a single family, but also extends a theorem of Frankl and Wong (2021) for two families. Moreover, our result could be viewed as a non-uniform version of a recent theorem of Li and Zhang (2025). The key in our proof is to utilize the generating set method and the pushing-pulling method together.

math.CO↗

Supersaturation in Nosal graphs: Triangles and books

In this paper, we use the spectral surplus $λ(G) - \sqrt{m}$ to measure how far $G$ lies above the Nosal threshold, and prove the following edge-spectral supersaturation results for triangles and books. (a) Every graph $G$ with $m\ge 3$ edges and $λ(G) \ge 1 + \sqrt{m-2}$ contains at least $m-2$ triangles, with equality if and only if $G = K_3 \vee \tfrac{m-3}{3} K_1$. This can be viewed as the third-layer supersaturation in the jump phenomenon, after the first layer $t(G) \ge \lfloor \tfrac{1}{2}(\sqrt{m}-1) \rfloor$ proved by Ning and Zhai, and the second layer $t(G) \ge \tfrac{m-1}{2}$ by Zhang and Zhai. (b) Every $m$-edge graph $G$ satisfies $t(G) \ge m\bigl(λ- \sqrt{m}\,\bigr)$, with equality if and only if $G$ is complete bipartite. Consequently, $λ(G) \ge \sqrt{m} + q$ forces $t(G) > q m$ for every real $q > 0$. This is an edge-spectral counterpart of the Lovász--Simonovits theorem, and it improves the Bollobás--Nikiforov bound $t(G) \ge \tfrac13 λ(λ^2 - m)$ in the range $\sqrt m \le λ(G) \le 1.3\sqrt m $. (c) Every $m$-edge Nosal graph $G$ contains a book of size greater than $\tfrac14 \sqrt{m}$. This improves two recent results on the booksize constant: $\tfrac{1}{24}$ proved by Li, Liu and Zhang, and $\tfrac19$ by Zhai, Li and Lou. This narrows the gap toward the conjectured optimal constant $\tfrac13$. (d) Every $m$-edge Nosal graph $G$ contains at least $\bigl(\tfrac{1}{8} - o(1)\bigr) m$ copies of the kite $C_4^+=B_2$, and the constant $\tfrac18$ is best possible. This determines the sharp asymptotic constant for counting $C_4^+$ and strengthens the $Ω(m)$ bound of Li, Liu and Zhang.

math.CO↗

An edge-spectral supersaturation of Mubayi's theorem for color-critical graphs

We study the supersaturation problem in its edge-spectral form. Let $λ(G)$ be the adjacency spectral radius of $G$. Nikiforov proved that every $K_{r+1}$-free graph $G$ with $m$ edges satisfies $λ(G)\le \sqrt{(1\!-\!1/r )2m}$. Recently, Li, Liu and Zhang proved the same bound for every $F$-free graph $G$, where $F$ is any color-critical graph with $χ(F)=r+1\ge4$, with equality only for regular complete $r$-partite graphs. It is then natural to ask how many copies of $F$ are forced once $λ(G)$ exceeds this threshold. Fang, Lin and Zhai answered this at the threshold itself, and conjectured that for any fixed $C>0$, the condition $λ(G)\ge \sqrt{(1\!-\!{1}/{r})2m} +C$ forces $Ω\!\left(m^{(f-1)/2}\right)$ copies. In this paper, we answer this question with the best possible constant. Building on the proof framework of Fang, Lin and Zhai, we prove that for every color-critical graph $F$ with $χ(F)=r+1\ge4$, there exists $δ_F>0$ such that if $m$ is sufficiently large, $0<q\leδ_F\sqrt m$, and $G$ is an $m$-edge graph with $λ^2(G)\ge 2\left(1-\tfrac1r\right)m+q$, then \[ N_F(G)\ge\bigl(B_F-o(1)\bigr)\,q\, m^{{(f-2)}/{2}}, \quad \text{where}~~ B_F:=\tfrac{α_F}{4} (\tfrac{2r}{r-1} )^{{f}/{2}}, \] and the constant $B_F$ is best possible. Our result can be viewed as an edge-spectral counterpart of Mubayi's theorem, since it converts the spectral surplus $q$ into a linear number of copies of $F$, and it solves the conjecture of Fang, Lin and Zhai in a stronger form.

math.CO↗

Spectral Sidorenko inequalities and edge-spectral supersaturation

We develop a spectral approach to Sidorenko-type inequalities and apply it to establish sharp edge-spectral supersaturation results. Let $H$ be a bipartite graph with $v$ vertices and $e$ edges, where $v\le e$, and write $M(G)=2e(G)$. We prove that Sidorenko's conjecture is equivalent to a spectral strengthening: $$ \hom(H,G)\ge M(G)^e |V(G)|^{v-2e} \quad \text{ if and only if }\quad \hom(H,G)\ge λ(G)^{2e-v}M(G)^{v-e}.$$ We also introduce an operator-norm certificate which, via the Riesz--Thorin interpolation, gives direct proofs of the spectral Sidorenko inequality in several cases. The converse direction in the equivalence theorem is proved by a tensor-power spectral regularization lemma. Our main result provides a unified framework to prove sharp asymptotic edge-spectral supersaturation results for degenerate bipartite graphs with the Sidorenko property, including complete bipartite graphs and even cycles. Let $S_{t-1,m}$ be the split graph with $m$ edges obtained by joining a clique $K_{t-1}$ to an independent set. For every $m$-edge graph $G$ with $λ(G)>λ(S_{t-1,m})$, $$\texttt{#} K_{t,t}(G) \ge \Big(\frac{2^{-(t-1)^2}}{(t!)^2}-o(1)\Big)m^t \quad \text{and}\quad \texttt{#}C_{2t}(G) \ge \Big(\frac{(t-1)!}{2t^t}-o(1)\Big)m^t.$$ Both constants are best possible: the first is attained asymptotically by random graphs, while the second is attained by split graphs. The supersaturation proofs combine spectral Sidorenko inequalities with a heavy-edge pruning process, a Perron-vector localized/delocalized dichotomy, and incidence-matrix inequalities.

math.CO↗

On a conjecture of distance spectral extremal problems

Brualdi and Hoffman proposed a well-known problem of determining the graph with maximum adjacency spectral radius among all graphs with given size $m$. Early work by Friedland and Stanley addressed some specific cases. This problem was later completely solved by Rowlinson and recently revisited by Cheng and Weng. Pioneering work on the distance matrix was carried out by Graham and Pollak, as well as by Graham and Lovász. The distance spectral radius $ρ(G)$ of a connected graph $G$ is the largest eigenvalue of its distance matrix. In this paper, we completely solve the problem of characterizing the connected graph with minimum distance spectral radius among all graphs with size $m$. Let $\mathcal{G}(m)$ be the class of connected graphs with $m$ edges. For every $m \ge 3$, let $n$ be the unique integer satisfying $\binom{n-1}{2} < m \le \binom{n}{2}$, and we write $m = \binom{n-1}{2} + s$ with $1 \le s \le n-1$. Recently, Lin and Zhou [Adv. in Appl. Math. 173 (2026)] investigated the graph in $\mathcal{G}(m)$ that minimizes $ρ(G)$ in the range $s \ge \max\{ \frac{n-6}{2}, 1\}$. However, the problem is much more difficult in the remaining range $1 \le s \le \frac{n-7}{2}$, and they conjectured that the unique minimizer is $\overline{P_{n,s+1}}$, the complement of a balanced disjoint union of paths. Using novel matrix analysis, we solve this conjecture in the affirmative. Moreover, we provide a new unified proof for the entire range $1 \le s \le n-1$. The key ingredients in our proof argument include an innovative comparison principle for the distance spectral radius, an increment analysis of $Φ$-functions on paths and cycles, an argument for balancing path lengths, and a walk enumeration technique via the Neumann series.

math.CO↗