Independent Sets in Graphs with an Excluded Clique Minor

Details Independent Sets in Graphs with an Excluded Clique Minor Independent Sets in Graphs with an Excluded Clique Minor

2006-01-09

arxiv.org/abs/math/0601172v1

Discrete Mathematics & Theoretical Computer Science 9(1):171-177, 2007

Mathematics

Combinatorics

Scientific paper

Let $G$ be a graph with $n$ vertices, with independence number $\alpha$, and
with with no $K_{t+1}$-minor for some $t\geq5$. It is proved that
$(2\alpha-1)(2t-5)\geq2n-5$.

Affiliated with

Also associated with

No associations

Rating

Independent Sets in Graphs with an Excluded Clique Minor 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 Independent Sets in Graphs with an Excluded Clique Minor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Independent Sets in Graphs with an Excluded Clique Minor will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-683980