Judicious partitions of 3-uniform hypergraphs

Details Judicious partitions of 3-uniform hypergraphs Judicious partitions of 3-uniform hypergraphs

2009-11-03

arxiv.org/abs/0911.0563v1

Mathematics

Combinatorics

Scientific paper

The vertices of any graph with $m$ edges can be partitioned into two parts so that each part meets at least $\frac{2m}{3}$ edges. Bollob\'as and Thomason conjectured that the vertices of any $r$-uniform graph may be likewise partitioned into $r$ classes such that each part meets at least $cm$ edges, with $c=\frac{r}{2r-1}$. In this paper, we prove this conjecture for the case $r=3$. In the course of the proof we shall also prove an extension of the graph case which was conjectured by Bollob\'as and Scott.

Affiliated with

Also associated with

No associations

Rating

Judicious partitions of 3-uniform hypergraphs 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 Judicious partitions of 3-uniform hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Judicious partitions of 3-uniform hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256530