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

团的有理指数

Rational exponents for cliques

Sean English, Anastasia Halfpap, Robert A. Krueger

AI总结:

该研究聚焦图论中禁族下子图拷贝数的渐近指数问题,推广Bukh和Conlon的结果,证明1到t间的所有有理数对团K_t均可实现,还确定了星图的可实现有理指数并关联Sidorenko型超饱和问题。

摘要:

设$\text{ex}(n,H,\text{mathcal{F}})$为不含$\text{mathcal{F}}$中任何图拷贝的$n$顶点图中,$H$拷贝的最大数量。在$H$和$\text{mathcal{F}}$固定的情况下,我们研究$\text{ex}(n,H,\text{mathcal{F}})$关于$n$的渐近行为。若存在有限图族$\text{mathcal{F}}$使得$\text{ex}(n,H,\text{mathcal{F}})=Θ(n^r)$,则称有理数$r$对$H$是“可实现的”。Bukh与Conlon利用随机代数构造证明,1到2之间的所有有理数都对$K_2$可实现。我们推广该结果,证明对所有$t\b2$,1到$t$之间的所有有理数都对$K_t$可实现。我们还确定了星图的可实现有理数,并指出其与一类Sidorenko型超饱和问题的关联。

英文摘要:

Let $\mathrm{ex}(n,H,\mathcal{F})$ be the maximum number of copies of $H$ in an $n$-vertex graph which contains no copy of a graph from $\mathcal{F}$. Thinking of $H$ and $\mathcal{F}$ as fixed, we study the asymptotics of $\mathrm{ex}(n,H,\mathcal{F})$ in $n$. We say that a rational number $r$ is \emph{realizable for $H$} if there exists a finite family $\mathcal{F}$ such that $\mathrm{ex}(n,H,\mathcal{F}) = Θ(n^r)$. Using randomized algebraic constructions, Bukh and Conlon showed that every rational between $1$ and $2$ is realizable for $K_2$. We generalize their result to show that every rational between $1$ and $t$ is realizable for $K_t$, for all $t \geq 2$. We also determine the realizable rationals for stars and note the connection to a related Sidorenko-type supersaturation problem.

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

↑