Intersection representation of digraphs in trees with few leaves

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other parameters (including Ferrers dimension), obtaining a string of sharp inequalities.
12 pages, 3 included figures

Keywords

Combinatorics, 05C35, 05C50, 05C75

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv