An extremal problem on potentially $K_{p,1,1}$-graphic sequences

Details An extremal problem on potentially $K_{p,1,1}$-graphic sequences An extremal problem on potentially $K_{p,1,1}$-graphic sequences

2004-08-22

arxiv.org/abs/math/0408292v2

Discrete Mathematics and Theoretical Computer Science 7(2005), 75-80

Mathematics

Combinatorics

5 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

An extremal problem on potentially $K_{p,1,1}$-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,1}$-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,1}$-graphic sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-225881