arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.05792math.CO
收藏

近似强正则图

Approximately Strongly Regular Graphs

Ferdinand Ihringer

摘要:

我们给变种的Krein界和绝对界的图的谱类似于一个强正则图。特别是,我们调查我们所谓的近似强正则图。我们将我们的结果应用于极值问题。除此之外,我们还证明了:(1)$\mathrm{PG}(n, q)$中的帽,其外部点上的割线数量变化不大,其大小最多为$O(q^{\frac34 n})$(作为$q \rightarrow \infty$或作为$n \rightarrow \infty$)。(2)最优伪随机$K_m$ -free图的阶为$v$,度为$k$,其大小为$i \leq m-3$的团的公共邻域上的导出子图类似于强正则图,有$k = O(v^{1 - \frac{1}{3m-2i-5}})$ .

英文摘要:

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to extremal problems. Among other things, we show the following: (1) Caps in $\mathrm{PG}(n, q)$ for which the number of secants on exterior points does not vary too much, have size at most $O(q^{\frac34 n})$ (as $q \rightarrow \infty$ or as $n \rightarrow \infty$). (2) Optimally pseudorandom $K_m$-free graphs of order $v$ and degree $k$ for which the induced subgraph on the common neighborhood of a clique of size $i \leq m-3$ is similar to a strongly regular graph, have $k = O(v^{1 - \frac{1}{3m-2i-5}})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑