An improved error term for minimum H-decompositions of graphs

Details An improved error term for minimum H-decompositions of graphs An improved error term for minimum H-decompositions of graphs

2011-09-12

arxiv.org/abs/1109.2571v1

Mathematics

Combinatorics

9 pages

Scientific paper

We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let \phi_H(n) denote the minimum number p such that any n-vertex G admits such a partition with at most p parts. We show that \phi_H(n)=ex(n,K_r)+\Theta(biex(n,H)) for \chi(H)>2, where biex(n,H) is the extremal number of the decomposition family of H. Since biex(n,H)=O(n^{2-\gamma}) for some \gamma>0 this improves on the bound \phi_H(n)=ex(n,H)+o(n^2) by Pikhurko and Sousa [J. Combin. Theory Ser. B 97 (2007), 1041-1055]. In addition it extends a result of \"Ozkahya and Person [J. Combin. Theory Ser. B, to appear].

Affiliated with

Also associated with

No associations

Rating

An improved error term for minimum H-decompositions of graphs 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 An improved error term for minimum H-decompositions of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An improved error term for minimum H-decompositions of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60748