On a conjecture of distance spectral extremal problems
Gansu Center for Applied Mathematics, Lanzhou University(兰州大学);School of Mathematics and Statistics, Minnan Normal University(闽南师范大学数学与统计学院);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心)
Hongzhang Chen, Jianxi Li, Yongtao Li
备注:
14 pages. Any comments and suggestions are welcome
Brualdi和Hoffman提出确定具有给定大小m的所有图中最大邻接谱半径的图的问题。早期工作由Friedland和Stanley处理了一些特定情况。该问题后来由Rowlinson完全解决,最近由Cheng和Weng重新审视。Graham和Pollak以及Graham和Lovász对距离矩阵进行了开创性工作。连通图G的距离谱半径ρ(G)是其距离矩阵的最大特征值。在本文中,我们完全解决了具有大小m的连通图中最小距离谱半径的图的特征问题。令G(m)为具有m条边的连通图类。对于每个m≥3,令n为满足C(n-1,2)<m≤C(n,2)的唯一整数,并将m=C(n-1,2)+s,其中1≤s≤n-1。最近,Lin和Zhou[Adv. in Appl. Math. 173 (2026)]研究了在范围s≥max{ (n-6)/2, 1}中G(m)中最小化ρ(G)的图。然而,在剩余范围1≤s≤(n-7)/2中,该问题更加困难,他们猜想唯一的最小化器是补集的平衡不相交路径的并集。使用新颖的矩阵分析方法,我们解决了这个猜想,并且提供了整个范围1≤s≤n-1的新统一证明。我们证明的关键成分包括创新的距离谱半径比较原理,路径和循环上Φ函数的增量分析,平衡路径长度的论证,以及通过Neumann级数的行走计数技术。
英文摘要:
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.
The extremal cases of the Erd\H os--Sós conjecture
Institute of Mathematics, Academia Sinica(数学研究所,中央研究院);Departamento de Ingeniería Matemática y Centro de Modelamiento Matemático (CNRS IRL2807), Universidad de Chile(数学工程系与数学建模中心(法国国家科学研究中心国际研究联系单位2807),智利大学)
Turán-Type Extremal Results for Distance-$k$ Graphs
Beijing Jiaotong University(北京交通大学);Jagiellonian University(雅盖隆大学);HUN-REN Alfréd Rényi Institute of Mathematics(匈牙利研究与教育国家研究所阿尔弗雷德·雷尼数学研究所);Nanjing University of Aeronautics and Astronautics(南京航空航天大学)
The Extremal Function and Colin de Verdière Graph Parameter
研究了Colin de Verdière参数不大于$t$的$n$顶点图的最大边数.我们猜想,对任意整数$t$,如果$G$是一个顶点数至少为$t$且Colin de Verdière参数至多为$t$的图,则有$|E(G)| \leq t|V(G)|-\binom{t+1}{2}$ .我们观察到一个关系图补猜想的Colin de Verdière参数和证明了图$G$的约束边上界,使得$μ(G) \leq 7$,或$μ(G) \geq |V(G)|-6$,或补的$G$是弦,或$G$是弦。
National University of Singapore(新加坡国立大学);University of Science and Technology of China(中国科学技术大学);Tsinghua University(清华大学);Georgia Institute of Technology(佐治亚理工学院)
一个$(n,s,q)$ -图是一个$n$ -顶点多重图,其中每个$s$ -顶点集至多包含$q$条边。自20世纪90年代以来,关于这类多重图的边重数和的最大值的Turán型问题一直在研究。最近,Mubayi和Terry [An extremal problem with a transcendental solution,Combinatorics Probability and Computing 2019]提出了确定$(n,s,q)$ -图中边重数乘积的最大值的问题。我们给出了一个一般的下界建设这个问题的许多对$(s,q)$,我们猜想是渐近最好的可能。我们证明了各种一般情况下,我们的猜想,特别是我们解决一个猜想Mubayi和特里的$(s,q)=(4,6a+3)$情况下的问题(为$a\geq2$),这反过来回答了一个问题的阿隆。我们还确定了“稀疏”多重图的问题的渐近行为(即当$q\leq 2\binom{s}{2}$)。最后,我们介绍了一些工具,可能是有用的攻击的问题一般。
On the Fourier Entropy Influence Conjecture for Extremal Classes
The Fourier Entropy-Influence (FEI) Conjecture of Friedgut and Kalai states that ${\bf H}[f] \leq C \cdot {\bf I}[f]$ holds for every Boolean function $f$ , where ${\bf H}[f]$ denotes the spectral entropy of $f$ , ${\bf I}[f]$ is its total influence, and $C > 0$ is a universal constant. Despite significant interest in the conjecture it has only been shown to hold for some classes of Boolean functions such as symmetric functions and read-once formulas. In this work, we prove the conjecture for extremal cases, functions with small influence and functions with high entropy. Specifically, we show …