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

$δ_k$ -图中的小集合

$δ_k$-small sets in graphs

Asen Bojilov, Nedyalko Nenov

摘要:

设$G$是一个简单的$n$ -顶点图,而$W\subseteq\V(G)$ .我们说$W$是$δ_k$ -小集合,如果$$ \sqrt[k]{\frac{\sum_{v\in W}d^k(v)}{\abs W}}\leq n-\abs W. $$令$φ^{(k)}(G)$表示最小自然数$r$,使得$\V(G)$分解为$r$ $δ_k$ -小集合,令$α^{(k)}(G)$表示$G$的$δ_k$ -小集合中的最大顶点数。本文给出了$α^{(k)}(G)$和$φ^{(k)}(G)$的界.由于$φ^{(k)}(G)\leqω(G)\leqχ(G)$和$α(G)\leqα^{(k)}(G)$,我们也得到团数$ω(G)$,色数$χ(G)$和独立数$α(G)$的界.

英文摘要:

Let $G$ be a simple $n$-vertex graph and $W\subseteq\V(G)$. We say that $W$ is a $δ_k$-small set if $$ \sqrt[k]{\frac{\sum_{v\in W}d^k(v)}{\abs W}}\leq n-\abs W. $$ Let $φ^{(k)}(G)$ denote the smallest natural number $r$ such that $\V(G)$ decomposes into $r$ $δ_k$-small sets, and let $α^{(k)}(G)$ denote the maximal number of vertices in a $δ_k$-small set of $G$. In this paper we obtain bounds for $α^{(k)}(G)$ and $φ^{(k)}(G)$. Since $φ^{(k)}(G)\leqω(G)\leqχ(G)$ and $α(G)\leqα^{(k)}(G)$, we obtain also bounds for the clique number $ω(G)$, the chromatic number $χ(G)$ and the independence number $α(G)$.

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

↑