An extremal problem on potentially $K_{m}-C_{4}$-graphic sequences

Details An extremal problem on potentially $K_{m}-C_{4}$-graphic sequences An extremal problem on potentially $K_{m}-C_{4}$-graphic sequences

2004-09-03

arxiv.org/abs/math/0409041v2

Journal of Combinatorial Mathematics and Combinatorial Computing, 61 (2007), 59-63.

Mathematics

Combinatorics

5 pages

Scientific paper

A sequence $S$ is potentially $K_{m}-C_{4}$-graphical if it has a realization containing a $K_{m}-C_{4}$ as a subgraph. Let $\sigma(K_{m}-C_{4}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_{m}-C_{4}, n)$ is potentially $K_{m}-C_{4}$-graphical. In this paper, we prove that $\sigma (K_{m}-C_{4}, n)\geq (2m-6)n-(m-3)(m-2)+2,$ for $n \geq m \geq 4.$ We conjecture that equality holds for $n \geq m \geq 4.$ We prove that this conjecture is true for $m=5$.

Affiliated with

Also associated with

No associations

Rating

An extremal problem on potentially $K_{m}-C_{4}$-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_{m}-C_{4}$-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_{m}-C_{4}$-graphic sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-529269