A note on complete subdivisions in digraphs of large outdegree

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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}).

Keywords

Combinatorics, 05C80; 05C20; 05C83

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/112688

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0605178
 http://arxiv.org/abs/math/0605178

Collections

arXiv