A condition that yields potentially K-13,(s)-graphic sequences

作者：Yin, Jian-Hua^*

来源：Utilitas Mathematica, 2015, 97: 119-128.

• graph
• degree sequence
• potentially K-1r,K-s-graphic sequence

A graphic sequence pi = (d(1), d(2), ... , d(n)) is said to be potentially K-1r,K-s-graphic if there is a realization of pi containing K-1r,K-s as a subgraph, where K-1r,K-s is the k(1) x k(2) x center dot center dot center dot x k(r+1) complete (r +1)-partite graph with k(1) = k(2) = center dot center dot center dot = k(r) = 1 and k(r+1) = s. In this paper, we give a condition that yields potentially K-13,K-s-graphic sequences for s >= 2 and n > 7s - 3.

• 出版日期2015-7
• 单位海南大学