Constructing dense graphs with sublinear Hadwiger number

Details Constructing dense graphs with sublinear Hadwiger number Constructing dense graphs with sublinear Hadwiger number

2011-08-24

arxiv.org/abs/1108.4953v2

Mathematics

Combinatorics

10 pages

Scientific paper

Mader asked to explicitly construct dense graphs for which the size of the largest clique minor is sublinear in the number of vertices. Such graphs exist as a random graph almost surely has this property. This question and variants were popularized by Thomason over several articles. We answer these questions by showing how to explicitly construct such graphs using blow-ups of small graphs with this property. This leads to the study of a fractional variant of the clique minor number, which may be of independent interest.

Affiliated with

Also associated with

No associations

Rating

Constructing dense graphs with sublinear Hadwiger number 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 Constructing dense graphs with sublinear Hadwiger number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing dense graphs with sublinear Hadwiger number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318331