Intersection representation of digraphs in trees with few leaves

Simple item page
dc.creatorLin, In-Jen
dc.creatorSen, Malay K.
dc.creatorWest, Douglas B.
dc.date1998-07-29
dc.date.accessioned2026-07-07T05:25:33Z
dc.date.available2026-07-07T05:25:33Z
dc.descriptionThe 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.
dc.description12 pages, 3 included figures
dc.identifierhttps://arxiv.org/abs/math/9807165
dc.identifierhttp://arxiv.org/abs/math/9807165
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77224
dc.subjectCombinatorics
dc.subject05C35, 05C50, 05C75
dc.titleIntersection representation of digraphs in trees with few leaves
dc.typetext

Files

Collections

arXiv