arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1307.0075math.CO
收藏

具有独立邻域的3-图的余度阈值

The codegree threshold for 3-graphs with independent neighbourhoods

Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko, Emil Vaughan

摘要:

给定一族3-图$F$,我们定义其余度阈值$\mathrm{coex}(n, F)$为最大数$d=d(n)$,使得存在一个$n$ -顶点3-图,其中每对顶点至少包含在$d$的3-边中,但不包含$F$的成员作为子图.设$F_{3,2}$是$\{a,b,c,d,e\}$上的3-图,它具有3-边$\{abc,abd,abe,cde\}$ .本文给出了$\mathrm{coex}(n, F_{3,2})= n/3 +o(n)$的两个证明,第一个是用组合论的直接证明,第二个是用标志代数的计算证明。从后一个证明中提取的信息然后用于获得稳定性结果,从该结果中我们又推导出所有足够大的$n$的精确的余度阈值:如果$n$与$1$模$3$全等,则为$\mathrm{coex}(n, F_{3,2})= \lfloor n/3 \rfloor -1$,否则为$\lfloor n/3 \rfloor$。此外,我们确定了一组的代码极值配置。

英文摘要:

Given a family of 3-graphs $F$, we define its codegree threshold $\mathrm{coex}(n, F)$ to be the largest number $d=d(n)$ such that there exists an $n$-vertex 3-graph in which every pair of vertices is contained in at least $d$ 3-edges but which contains no member of $F$ as a subgraph. Let $F_{3,2}$ be the 3-graph on $\{a,b,c,d,e\}$ with 3-edges $\{abc,abd,abe,cde\}$. In this paper, we give two proofs that $\mathrm{coex}(n, F_{3,2})= n/3 +o(n)$, the first by a direct combinatorial argument and the second via a flag algebra computation. Information extracted from the latter proof is then used to obtain a stability result, from which in turn we derive the exact codegree threshold for all sufficiently large $n$: $\mathrm{coex}(n, F_{3,2})= \lfloor n/3 \rfloor -1$ if $n$ is congruent to $1$ modulo $3$, and $\lfloor n/3 \rfloor$ otherwise. In addition we determine the set of codegree-extremal configurations.

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

↑