中文

对于边色临界图,非$r$-部谱极值图是边极值图

组合数学 2026-07-01 v1

摘要

如果图的色数超过rr,则称该图为非rr-部图。对于色数χ(F)=r+1\chi(F)=r+1的边色临界图FF,设exr+1,ρ(n,F)\mathrm{ex}_{r+1,\rho}(n,F)nn阶非rr-部FF-自由图的最大邻接谱半径,并设EXr+1,ρ(n,F)\mathrm{EX}_{r+1,\rho}(n,F)EXr+1(n,F)\mathrm{EX}_{r+1}(n,F)分别为达到该最大谱半径和最大边数exr+1(n,F)\mathrm{ex}_{r+1}(n,F)的图族。Fang和Zhai猜想对于每个这样的FF和所有足够大的nn,有EXr+1,ρ(n,F)EXr+1(n,F)\mathrm{EX}_{r+1,\rho}(n,F)\subseteq\mathrm{EX}_{r+1}(n,F)。在本文中,我们在假设exr+1(n,F)=E(Tn,r)n/r+O(1)\mathrm{ex}_{r+1}(n,F)=|E(T_{n,r})|-\lfloor n/r\rfloor+O(1)(其中Tn,rT_{n,r}是Turán图)以及FF的子分解族满足一个结构条件的情况下证明了这一包含关系。作为主要应用,对于F=K1,1,t3,,tr+1F=K_{1,1,t_3,\ldots,t_{r+1}}t3,,tr+12t_3,\ldots,t_{r+1}\ge 2,我们证明了对所有足够大的nnexr+1(n,F)=E(Tn,r)nr+2(tmin1),tmin:=min{t3,,tr+1}, \mathrm{ex}_{r+1}(n,F)=|E(T_{n,r})|-\Bigl\lfloor\frac nr\Bigr\rfloor+2(t_{\min}-1), \qquad t_{\min}:=\min\{t_3,\ldots,t_{r+1}\}, 并由此推出EXr+1,ρ(n,F)EXr+1(n,F)\mathrm{EX}_{r+1,\rho}(n,F)\subseteq\mathrm{EX}_{r+1}(n,F)

关键词

引用

@article{arxiv.2607.00561,
  title  = {For edge-color-critical graphs, non-$r$-partite spectral extremal graphs are edge extremal},
  author = {Suil O and Jiadong Wu},
  journal= {arXiv preprint arXiv:2607.00561},
  year   = {2026}
}

备注

25 pages