Intersection representation of digraphs in trees with few leaves
نویسندگان
چکیده
منابع مشابه
Intersection representation of digraphs in trees with few leaves
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.
متن کاملSpotting Trees with Few Leaves
We show two results related to the Hamiltonicity and k-Path algorithms in undirected graphs by Björklund [FOCS’10], and Björklund et al., [arXiv’10]. First, we demonstrate that the technique used can be generalized to finding some k-vertex tree with l leaves in an n-vertex undirected graph in O(1.6572) time. It can be applied as a subroutine to solve the k-Internal Spanning Tree (k-IST) problem...
متن کاملOn finding spanning trees with few leaves
The problem of finding a spanning tree with few leaves is motivated by the design of communication networks, where the cost of the devices depends on their routing functionality (ending, forwarding, or routing a connection). Besides this application, the problem has its own theoretical importance as a generalization of the Hamiltonian path problem. Lu and Ravi showed that there is no constant f...
متن کاملOriented trees in digraphs
Let f(k) be the smallest integer such that every f(k)-chromatic digraph contains every oriented tree of order k. Burr proved f(k) ≤ (k − 1)2 in general, and conjectured f(k) = 2k − 2. Burr also proved that every (8k − 9)-chromatic digraph contains every antidirected tree. We improve both of Burr’s bounds. We show that f(k) ≤ k2/2 − k/2 + 1 and that every antidirected tree of order k is containe...
متن کاملt-Designs with few intersection numbers
Pott, A. and M. Shriklande, t-Designs with few intersection numbers, Discrete Mathematics 90 (1991) 215-217. We give a method to obtain new i-designs from t-designs with j distinct intersection numbers if i + j 1 does not exceed t.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1999
ISSN: 0364-9024,1097-0118
DOI: 10.1002/(sici)1097-0118(199912)32:4<340::aid-jgt3>3.0.co;2-r