Generalizations of the Tree Packing Conjecture

Details Generalizations of the Tree Packing Conjecture Generalizations of the Tree Packing Conjecture

2011-04-04

arxiv.org/abs/1104.0642v3

Mathematics

Combinatorics

Scientific paper

The Gy\'arf\'as tree packing conjecture asserts that any set of trees with $2,3, ..., k$ vertices has an (edge-disjoint) packing into the complete graph on $k$ vertices. Gy\'arf\'as and Lehel proved that the conjecture holds in some special cases. We address the problem of packing trees into $k$-chromatic graphs. In particular, we prove that if all but three of the trees are stars then they have a packing into any $k$-chromatic graph. We also consider several other generalizations of the conjecture.

Affiliated with

Also associated with

No associations

Rating

Generalizations of the Tree Packing Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalizations of the Tree Packing Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalizations of the Tree Packing Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318435