AbstractIn this note we improve significantly the result appeared in [4] by showing that any sequence of trees {T2, T3,…, Tt} can be packed into the complete bipartite graph Kn−1, n/2 (n even) for t ≈ 0.3n. Furthermore we support Fishburn's Conjecture [2] by showing that any sequence {T2, T4,…, Tt} can be packed into Hn (n even) where t ≈ 0.23n
AbstractLet λKn denote the complete graph of order n and multiplicity λ. We prove Tarsi's conjecture...
[[abstract]]Let Kn,n be the complete bipartite graph with two parts of equal size n. In this paper...
It has been shown [3] that any bipartite graph $K_{a,b}$, where a, b are even integers, can be decom...
AbstractIn this note we improve significantly the result appeared in [4] by showing that any sequenc...
AbstractLet T2, …, T1 be a sequence of trees, where Ti has i vertices. We show that if t<0.79n, then...
summary:In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009...
A conjecture of Gy´arf´as and Lehel asks if the sequence of trees T1, T2, ..., Tn, where Ti is a tre...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We show that asymptotically almost surely a tree with m edges decomposes the complete bipartite grap...
We prove that for any pair of constants a>0 and D and for n sufficiently large, every family of tree...
We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any tr...
We prove that given any sequence of $n$ bounded degree trees so that the $j$th tree has $j$ vertices...
AMS Subject Classication: 05C70 Abstract. For any tree T of order n, there is a packing of three cop...
Let T be a tree with m edges. A well-known conjecture of Ringel states that T decomposes the complet...
The Gyárfás tree packing conjecture asserts that any set of trees with 2,3,...,k vertices has an (ed...
AbstractLet λKn denote the complete graph of order n and multiplicity λ. We prove Tarsi's conjecture...
[[abstract]]Let Kn,n be the complete bipartite graph with two parts of equal size n. In this paper...
It has been shown [3] that any bipartite graph $K_{a,b}$, where a, b are even integers, can be decom...
AbstractIn this note we improve significantly the result appeared in [4] by showing that any sequenc...
AbstractLet T2, …, T1 be a sequence of trees, where Ti has i vertices. We show that if t<0.79n, then...
summary:In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009...
A conjecture of Gy´arf´as and Lehel asks if the sequence of trees T1, T2, ..., Tn, where Ti is a tre...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We show that asymptotically almost surely a tree with m edges decomposes the complete bipartite grap...
We prove that for any pair of constants a>0 and D and for n sufficiently large, every family of tree...
We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any tr...
We prove that given any sequence of $n$ bounded degree trees so that the $j$th tree has $j$ vertices...
AMS Subject Classication: 05C70 Abstract. For any tree T of order n, there is a packing of three cop...
Let T be a tree with m edges. A well-known conjecture of Ringel states that T decomposes the complet...
The Gyárfás tree packing conjecture asserts that any set of trees with 2,3,...,k vertices has an (ed...
AbstractLet λKn denote the complete graph of order n and multiplicity λ. We prove Tarsi's conjecture...
[[abstract]]Let Kn,n be the complete bipartite graph with two parts of equal size n. In this paper...
It has been shown [3] that any bipartite graph $K_{a,b}$, where a, b are even integers, can be decom...
DOI
Add to ORKG