Abundance of Unique Subhypergraphs
唯一子超图的丰度
Xichao Shu, Zhuo Wu, Yisai Xue
AI总结 研究k-一致超图中唯一子超图的数量比例,证明对于k≥3,存在正下界2/9,与图情形(k=2)趋于0形成对比。
详情
给定$k$-一致超图$G$和$H$,如果$H$恰好包含一个与$G$同构的子超图,则称$G$是$H$的唯一子超图。对于$n$顶点$k$-图$H$,令$f_k(H)$为$H$的非同构唯一子超图的数量,除以$2^{\\binom n k}/n!$进行归一化,并令$f_k(n)$为所有$n$顶点$k$-图$H$上$f_k(H)$的最大值。在图的情形$k=2$时,Erdős 问是否存在常数$δ>0$使得对所有$n$有$f_2(n)>δ$,并悬赏$100$美元证明、$25$美元反驳。最近,Bradač 和 Christoph 否定了这个问题,证明$f_2(n)$趋于$0$,即没有$n$顶点图包含所有$n$顶点图的正比例作为唯一子图。在本文中,我们证明对于$k\\ge3$的$k$-一致超图,情况根本不同。特别地,对每个固定整数$k\\ge 3$,我们证明$\\\liminf_{n\\to\\\infty} f_k(n) \\\ge 2/9$。
Given $k$-uniform hypergraphs $G$ and $H$, we say that $G$ is a unique subhypergraph of $H$ if $H$ contains exactly one subhypergraph isomorphic to $G$. For an $n$-vertex $k$-graph $H$, let $f_k(H)$ be the number of non-isomorphic unique subhypergraphs of $H$, normalized by $2^{\binom n k}/n!$, and let $f_k(n)$ be the maximum of $f_k(H)$ over all $n$-vertex $k$-graphs $H$. In the graph case $k=2$, Erdős asked whether there exists a constant $δ>0$ such that $f_2(n)>δ$ for all $n$, offering \$100 for a proof and \$25 for a disproof. Recently, Bradač and Christoph answered this question in the negative,, proving that $f_2(n)$ tends to $0$, or equivalently that no $n$-vertex graph contains a positive proportion of all $n$-vertex graphs as unique subgraphs. In this paper we show that the situation is fundamentally different for $k$-uniform hypergraphs with $k\ge3$. In particular, for every fixed integer $k\ge 3$, we prove that $\liminf_{n\to\infty} f_k(n) \ge 2/9$.