Edge-decomposition of graphs into copies of a tree with four edges

Details Edge-decomposition of graphs into copies of a tree with four edges Edge-decomposition of graphs into copies of a tree with four edges

2012-03-08

arxiv.org/abs/1203.1671v1

Mathematics

Combinatorics

Scientific paper

We study edge-decompositions of highly connected graphs into copies of a given tree. In particular we attack the following conjecture by Bar\'at and Thomassen: for each tree $T$, there exists a natural number $k_T$ such that if $G$ is a $k_T$-edge-connected graph, and $|E(T)|$ divides $|E(G)|$, then $E(G)$ has a decomposition into copies of $T$. As one of our main results it is sufficient to prove the conjecture for bipartite graphs. Let $Y$ be the unique tree with degree sequence $(1,1,1,2,3)$. We prove that if $G$ is a 191-edge-connected graph of size divisible by 4, then $G$ has a $Y$-decomposition. This is the first instance of such a theorem, in which the tree is different from a path or a star.

Affiliated with

Also associated with

No associations

Rating

Edge-decomposition of graphs into copies of a tree with four edges 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 Edge-decomposition of graphs into copies of a tree with four edges, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge-decomposition of graphs into copies of a tree with four edges will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16657