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

具有有界密度的图的泛性

Universality for graphs with bounded density

Noga Alon, Natalie Dodson, Carmen Jackson, Rose McCarty, Rajko Nenadov, Lani Southern

AI总结:

本文研究有界密度图族的泛图问题,构造了边数接近下界的泛图,并在最大度受限或密度为自然数时得到近乎最优乃至渐近最优的结果。

摘要:

若一个图 $G$ 对(有限)图族 $\mathcal{H}$ 具有 $\textit{泛性}$,则每个 $H \in \mathcal{H}$ 都是 $G$ 的子图。对于给定的图族 $\mathcal{H}$,目标是确定一个 $\mathcal{H}$-泛图所能具有的最少边数。为了统一若干近期结果,我们考虑具有有界密度的图族。特别地,我们构造了一个具有 $O_d\left( n^{2 - 1/(\lceil d \rceil + 1)} \right)$ 条边的图,它包含每个密度至多为 $d \in \mathbb{Q}$($d \ge 1$)的 $n$ 顶点图,这接近于通过对精心选择的(小)图进行提升计数而得到的下界 $Ω(n^{2 - 1/d - o(1)})$。当限制此类图的最大度为常数时,我们得到近乎最优的泛性。若进一步假设 $d \in \mathbb{N}$,我们则得到一个渐近最优的构造。

英文摘要:

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an $\mathcal{H}$-universal graph can have. With the aim of unifying a number of recent results, we consider a family of graphs with bounded density. In particular, we construct a graph with $O_d\left( n^{2 - 1/(\lceil d \rceil + 1)} \right)$ edges which contains every $n$-vertex graph with density at most $d \in \mathbb{Q}$ ($d \ge 1$), which is close to a lower bound $Ω(n^{2 - 1/d - o(1)})$ obtained by counting lifts of a carefully chosen (small) graph. When restricting the maximum degree of such graphs to be constant, we obtain a near-optimal universality. If we further assume $d \in \mathbb{N}$, we get an asymptotically optimal construction.

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

↑