# Search results for: John Haslegrave

Journal of Graph Theory > 100 > 3 > 530 - 542

Random Structures & Algorithms > 58 > 1 > 150 - 163

Random Structures & Algorithms > 56 > 3 > 775 - 795

*r*vertices from the graph with replacement, with probabilities proportional to their degrees plus a constant

*α*. A new vertex...

Discrete Mathematics > 2018 > 341 > 1 > 184-193

Discrete Applied Mathematics > 2017 > 219 > C > 32-39

Discrete Mathematics > 2016 > 339 > 11 > 2804-2811

Random Structures & Algorithms > 48 > 4 > 751 - 766

Discrete Mathematics > 2016 > 339 > 1 > 109-117

Theoretical Computer Science > 2014 > 550 > Complete > 100-106

Journal of Combinatorial Theory, Series B > 2014 > 107 > Complete > 26-41

Discrete Mathematics > 2014 > 314 > Complete > 1-5

Combinatorica > 2014 > 34 > 5 > 561-572

*m*edges may be partitioned into two parts so that each part meets at least $$\tfrac{{2m}} {3}$$ edges. Bollobás and Thomason conjectured that the vertices of any r-uniform hypergraph with

*m*edges may likewise be partitioned into

*r*classes such that each part meets at least $$\tfrac{r} {{2r - 1}}$$ edges. In this paper we prove the weaker statement that, for...

Combinatorica > 2012 > 32 > 4 > 451-471

*m*edges can be partitioned into two parts so that each part meets at least $$\frac{{2m}} {3}$$ edges. Bollobás 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 $$\frac{r} {{2r - 1}}$$ . In this paper, we prove this conjecture for the case

*r*=3. In the...