Complete Minors, Independent Sets, and Chordal Graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conjecture states that h(G) >= \chi(G). Since \chi(G) \alpha(G) >= |V(G)|, Hadwiger's Conjecture implies that \alpha(G) h(G) >= |V(G)|. We show that (2 \alpha(G) - \lceil log_t(t \alpha(G)/2) \rceil) h(G) \geq |V(G)| where t is approximately 6.83. For graphs with \alpha(G) \geq 14, this improves on a recent result of Kawarabayashi and Song who showed (2 \alpha(G) - 2) h(G) >= |V(G)| when \alpha(G) >= 3.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-332317

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.