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

关于$k$ -边极大$r$ -一致超图的尺寸

On the sizes of $k$-edge-maximal $r$-uniform hypergraphs

Yingzhi Tian, Liqiong Xu, Hong-Jian Lai, Jixiang Meng

摘要:

设$H=(V,E)$是一个超图,其中$V$是顶点的集合,$E$是$V$的非空子集的集合,称为边。如果$H$的所有边都有相同的基数$r$,则$H$是$r$ -均匀超图;如果$E$由$V$的所有$r$ -子集组成,则$H$是完全$r$ -均匀超图,记为$K_n^r$,其中$n=|V|$。一个超图$H'=(V',E')$称为$H=(V,E)$的子超图,如果$V'\subseteq V$和$E'\subseteq E$。一个$r$ -一致超图$H=(V,E)$是$k$ -边极大的,如果$H$的每个子超图的边连通度至多为$k$,但对于任何边$e\in E(K_n^r)\setminus E(H)$,$H+e$至少包含一个边连通度至少为$k+1$的子超图.令$k$和$r$是具有$k\geq2$和$r\geq2$的整数,并且令$t=t(k,r)$是使得$(^{t-1}_{r-1})\leq k$ .也就是说,$t$是满足$(^{t-1}_{r-1})\leq k<(^{t}_{r-1})$的整数。证明了:若$H$是$r$ -均匀$k$ -边极大超图,使得$n=|V(H)|\geq t$,则($i$)$|E(H)|\leq (^{t}_{r})+(n-t)k$,且此界是最佳可能界;($ii$)$|E(H)|\geq (n-1)k -((t-1)k-(^{t}_{r}))\lfloor\frac{n}{t}\rfloor$,且此界是最佳可能界.这推广了文献[8]和[6]中的结果。

英文摘要:

Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$ is a $r$-uniform hypergraph; if $E$ consists of all $r$-subsets of $V$, then $H$ is a complete $r$-uniform hypergraph, denoted by $K_n^r$, where $n=|V|$. A hypergraph $H'=(V',E')$ is called a subhypergraph of $H=(V,E)$ if $V'\subseteq V$ and $E'\subseteq E$. A $r$-uniform hypergraph $H=(V,E)$ is $k$-edge-maximal if every subhypergraph of $H$ has edge-connectivity at most $k$, but for any edge $e\in E(K_n^r)\setminus E(H)$, $H+e$ contains at least one subhypergraph with edge-connectivity at least $k+1$. Let $k$ and $r$ be integers with $k\geq2$ and $r\geq2$, and let $t=t(k,r)$ be the largest integer such that $(^{t-1}_{r-1})\leq k$. That is, $t$ is the integer satisfies $(^{t-1}_{r-1})\leq k<(^{t}_{r-1})$. We prove that if $H$ is a $r$-uniform $k$-edge-maximal hypergraph such that $n=|V(H)|\geq t$, then ($i$) $|E(H)|\leq (^{t}_{r})+(n-t)k$, and this bound is best possible; ($ii$) $|E(H)|\geq (n-1)k -((t-1)k-(^{t}_{r}))\lfloor\frac{n}{t}\rfloor$, and this bound is best possible. This extends former results in [8] and [6].

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

↑