most citedFC-families, and improved bounds for Frankl's Conjecture

3 citations · 8 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO20072 cited

Majority bootstrap percolation on the hypercube

József Balogh, Béla Bollobás, Robert Morris

In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already inf…

math.CO2007

Hereditary properties of tournaments

József Balogh, Béla Bollobás, Robert Morris

A collection of unlabelled tournaments P is called a hereditary property if it is closed under isomorphism and under taking induced sub-tournaments. The speed of P is the function…

math.CO2007

Highly connected multicoloured subgraphs of multicoloured graphs

Henry Liu, Robert Morris, Noah Prince

Suppose the edges of the complete graph on n vertices are coloured using r colours; how large a k-connected subgraph are we guaranteed to find, which uses only at most s of the col…

math.CO20073 cited

Highly connected monochromatic subgraphs of multicoloured graphs

Henry Liu, Robert Morris, Noah Prince

We consider the following question of Bollobas: given an r-colouring of the edges of the complete graph on n vertices, how large a k-connected subgraph can we find using only one c…

math.CO2007

Hereditary properties of ordered graphs

József Balogh, Béla Bollobás, Robert Morris

An ordered graph is a graph together with a linear order on its vertices. A hereditary property of ordered graphs is a collection of ordered graphs closed under taking induced orde…

math.CO2007

Hereditary properties of partitions, ordered graphs and ordered hypergraphs

József Balogh, Béla Bollobás, Robert Morris

In this paper we use the Klazar-Marcus-Tardos method to prove that if a hereditary property of partitions P has super-exponential speed, then for every k-permutation pi, P contains…