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

关于关联图的极值数

On the extremal number of incidence graphs

Jisun Baek, David Conlon, Joonkyung Lee

AI总结:

本文通过将反射群方法发展为纯代数形式,推广了 Janzer–Sudakov 的渗流性质,得到了广义面关联图极值数的一般上界,并确认了 Conlon–Lee 的一个猜想。

摘要:

给定一个图 $H$ 和一个自然数 $n$,极值数 $\mathrm{ex}(n, H)$ 是不包含 $H$ 副本的 $n$ 个顶点的图中边的最大数目。在本文中,我们得到了广义面关联图的极值数的一个一般上界,该图族包括正则多胞体的标准面关联图。这建立并推广了 Janzer 和 Sudakov 的工作,他们对于超立方体和二部 Kneser 图得到了相同的界,并使我们能够确认 Conlon 和 Lee 关于某些关联图的无 $K_{r,r}$ 二部图的极值数的一个猜想。\n 在他们的工作中,Janzer 和 Sudakov 证明了只要图 $H$ 满足某个渗流性质,极值数的这样一个上界就成立,该性质刻画了 Cauchy--Schwarz 不等式重复应用的适当序列,他们随后对超立方体和二部 Kneser 图验证了这一性质。这个渗流性质与 Conlon 和 Lee 早期关于弱范数图的工作中出现的一个性质非常相似。在后一项工作中,Conlon 和 Lee 基于反射群的性质发展了一种控制 Cauchy--Schwarz 不等式重复应用的方法,这使他们能够分离出一大类弱范数图。在这里,我们进一步发展了这一方法,将其转化为一种纯代数形式,这不仅使我们能够将其与 Janzer--Sudakov 的结果结合起来,得到关于关联图的极值数的期望结果,而且还简化了 Conlon--Lee 关于弱范数图的结果以及 Coregliano 的一个相关结果的证明。

英文摘要:

Given a graph $H$ and a natural number $n$, the extremal number $\mathrm{ex}(n, H)$ is the largest number of edges in an $n$-vertex graph containing no copy of $H$. In this paper, we obtain a general upper bound for the extremal number of generalised face-incidence graphs, a family which includes the standard face-incidence graphs of regular polytopes. This builds on and generalises work of Janzer and Sudakov, who obtained the same bound for hypercubes and bipartite Kneser graphs, and allows us to confirm a conjecture of Conlon and Lee on the extremal number of $K_{r,r}$-free bipartite graphs for certain incidence graphs. In their work, Janzer and Sudakov showed that such an upper bound on the extremal number holds whenever the graph $H$ satisfies a certain percolation property which captures an appropriate sequence of repeated applications of the Cauchy--Schwarz inequality, a property which they then verify for hypercubes and bipartite Kneser graphs. This percolation property bears close resemblance to a property that arose in earlier work of Conlon and Lee on weakly norming graphs. In this latter work, Conlon and Lee developed a method for controlling repeated applications of the Cauchy--Schwarz inequality based on the properties of reflection groups, which then allowed them to isolate a broad family of weakly norming graphs. Here, we develop this method further, casting it in a purely algebraic form that allows us not only to combine it with the Janzer--Sudakov result and obtain the desired result about the extremal number of incidence graphs, but also to simplify the proofs of both the Conlon--Lee result on weakly norming graphs and a related result of Coregliano.

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

↑