A note on complete subdivisions in digraphs of large outdegree

Simple item page
dc.creatorKühn, Daniela
dc.creatorOsthus, Deryk
dc.creatorYoung, Andrew
dc.date2006-05-07
dc.date.accessioned2026-07-07T07:13:59Z
dc.date.available2026-07-07T07:13:59Z
dc.descriptionMader 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}).
dc.identifierhttps://arxiv.org/abs/math/0605178
dc.identifierhttp://arxiv.org/abs/math/0605178
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112688
dc.subjectCombinatorics
dc.subject05C80; 05C20; 05C83
dc.titleA note on complete subdivisions in digraphs of large outdegree
dc.typetext

Files

Collections

arXiv