Paper Info
Title
The Bollobás-Thomason conjecture for 3-uniform hypergraphs.
Abstract
The vertices of any graph with m edges can be partitioned into two parts so that each part meets at least edges. Bollobas 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 . 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 Bollobas and Scott.
Year
DOI
Venue
2012
10.1007/s00493-012-2696-x
Combinatorica
Field
DocType
Volume
Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Constraint graph,Conjecture,Mathematics,Path graph
Journal
32
Issue
ISSN
Citations 
4
0209-9683
7
PageRank 
References 
Authors
0.56
8
1
Name
Order
Citations
PageRank
John Haslegrave1295.74