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

$3$的饱和度-均匀松散$3$ -循环

Saturation for the $3$-uniform loose $3$-cycle

Sean English, Alexandr Kostochka, Dara Zirlin

摘要:

设$F$和$H$是$k$ -一致超图.如果$H$不包含与$F$同构的子图,则称$H$是$F$ -饱和的,但对于任何超边$e\not\in E(H)$,$H+e$都包含。$F$的饱和数,记为$\mathrm{sat}_k(n,F)$,是指$F$ -饱和$k$ -均匀超图$H$在$n$顶点上的最小边数.令$C_3^{(3)}$表示$3$上的$3$-均匀松弛环。本文证明了\[ \left(\frac{4}3+o(1)\right)n\leq \mathrm{sat}_3(n,C_3^{(3)})\leq \frac{3}2n+O(1). \]这是第一个关于固定超图短圈饱和数的非平凡结果。

英文摘要:

Let $F$ and $H$ be $k$-uniform hypergraphs. We say $H$ is $F$-saturated if $H$ does not contain a subgraph isomorphic to $F$, but $H+e$ does for any hyperedge $e\not\in E(H)$. The saturation number of $F$, denoted $\mathrm{sat}_k(n,F)$, is the minimum number of edges in a $F$-saturated $k$-uniform hypergraph $H$ on $n$ vertices. Let $C_3^{(3)}$ denote the $3$-uniform loose cycle on $3$ edges. In this work, we prove that \[ \left(\frac{4}3+o(1)\right)n\leq \mathrm{sat}_3(n,C_3^{(3)})\leq \frac{3}2n+O(1). \] This is the first non-trivial result on the saturation number for a fixed short hypergraph cycle.

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

↑