A note on complete subdivisions in digraphs of large outdegree

Details A note on complete subdivisions in digraphs of large outdegree A note on complete subdivisions in digraphs of large outdegree

2006-05-07

arxiv.org/abs/math/0605178v1

Mathematics

Combinatorics

Scientific paper

Mader conjectured that for all k there is an integer d(k) such that every digraph of minimum outdegree at least d(k) contains a subdivision of a transitive tournament of order k. In this note we observe that if the minimum outdegree of a digraph is sufficiently large compared to its order then one can even guarantee a subdivision of a large complete digraph. More precisely, let G be a digraph of order n whose minimum outdegree is at least d. Then G contains a subdivision of a complete digraph of order at least d^2/(8n^{3/2}).

Affiliated with

Also associated with

No associations

Rating

A note on complete subdivisions in digraphs of large outdegree 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 A note on complete subdivisions in digraphs of large outdegree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on complete subdivisions in digraphs of large outdegree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67091