An extremal problem on potentially $K_{p_{1},p_{2},...,p_{t}}$-graphic sequences

Details An extremal problem on potentially $K_{p_{1},p_{2},...,p_{t}}$-graphic sequences An extremal problem on potentially $K_{p_{1},p_{2},...,p_{t}}$-graphic sequences

2004-08-24

arxiv.org/abs/math/0408326v1

Mathematics

Combinatorics

4 pages

Scientific paper

A sequence $S$ is potentially $K_{p_{1},p_{2},...,p_{t}}$ graphical if it has a realization containing a $K_{p_{1},p_{2},...,p_{t}}$ as a subgraph, where $K_{p_{1},p_{2},...,p_{t}}$ is a complete t-partite graph with partition sizes $p_{1},p_{2},...,p_{t} (p_{1}\geq p_{2}\geq ...\geq p_{t} \geq 1)$. Let $\sigma(K_{p_{1},p_{2},...,p_{t}}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_{p_{1},p_{2},...,p_{t}}, n)$ is potentially $K_{p_{1},p_{2},...,p_{t}}$ graphical. In this paper, we prove that $\sigma (K_{p_{1},p_{2},...,p_{t}}, n)\geq 2[((2p_{1}+2p_{2}+...+2p_{t}-p_{1}-p_{2}-...-p_{i}-2)n -(p_{1}+p_{2}+...+p_{t}-p_{i})(p_{i}+p_{i+1}+...+p_{t}-1)+2)/2]$ for $n \geq p_{1}+p_{2}+...+p_{t}, i=2,3,...,t.$

Affiliated with

Also associated with

No associations

Rating

An extremal problem on potentially $K_{p_{1},p_{2},...,p_{t}}$-graphic sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An extremal problem on potentially $K_{p_{1},p_{2},...,p_{t}}$-graphic sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An extremal problem on potentially $K_{p_{1},p_{2},...,p_{t}}$-graphic sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-249530