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

关于最大度比的Frankl-Wang 3/7猜想的阈值

Thresholds for the Frankl-Wang $3/7$ conjecture on maximum-degree ratios

School of Mathematical Sciences, Shenzhen University(深圳大学数学科学学院);School of Mathematics and Statistics, Qinghai Minzu University(青海民族大学数学与统计学院)

Zejun Huang, Zhiyi Liu, Lu Lu, Tingzeng Wu

AI总结:

研究Frankl-Wang关于相交族最大度比的3/7猜想,用截断法说明不存在线性阈值,证k=3时猜想成立,利用伪向日葵界给出k≥4时明确多项式阈值。

摘要:

设\(\mathcal{F}\subset\binom{[n]}{k}\)为相交族,定义\(\Delta(\mathcal{F})\)与\(\varrho(\mathcal{F})\)。Frankl和Wang猜想在特定条件下\(\varrho(\mathcal{F})\geq 3/7\)。本文获三个结果,如不存在线性阈值,证k=3时成立,给出k≥4时明确阈值条件。

英文摘要:

Let $\mathcal{F}\subset\binom{[n]}{k}$ be an intersecting family, $Δ(\mathcal{F})=\max_{x\in[n]}|\{F\in\mathcal{F}:x\in F\}|$, and $\varrho(\mathcal{F})=Δ(\mathcal{F})/|\mathcal{F}|$. Frankl and Wang conjectured that if $n>100k$ and $|\mathcal{F}|>\binom{n-3}{k-3}$, then $\varrho(\mathcal{F})\ge 3/7$; the constant $3/7$ is sharp because of the Fano-plane construction. In this note we obtain three results. First, we show that no linear threshold $n>Ck$ can be sufficient: using a truncated Fano-plane construction we exhibit, for every constant $C$ and all large $k$, an intersecting family with $n>Ck$, $|\mathcal{F}|>\binom{n-3}{k-3}$, yet $\varrho(\mathcal{F})<3/7$. In particular, the original condition $n>100k$ does not guarantee the conclusion. Second, for $k=3$ we prove that $\varrho(\mathcal{F})\ge 3/7$ holds for every nonempty intersecting $3$-uniform family; the proof is nontrivial and does not rely on any assumption on $n$ or $|\mathcal{F}|$. Third, using the classical pseudo-sunflower bound $|\mathcal{F}|\le t^k$ (for families containing no pseudo-sunflower of size $t+1$), we obtain a completely explicit polynomial threshold for all $k\ge4$: if $n>(k-3)(7k^4+k)+3$ and $|\mathcal{F}|>\binom{n-3}{k-3}$, then $\varrho(\mathcal{F})\ge 3/7$. In particular, the simplified bound $n>7k^5$ is sufficient for every $k\ge4$.

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

↑