Richard Mycroft

activity

20082026

most citedHamilton l-cycles in uniform hypergraphs

81 citations · 322 across the 17 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

Tight cycles and regular slices in dense hypergraphs

Peter Allen, Julia Böttcher, Oliver Cooley +1

We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these…

math.CO2014★ 24 cited

A random version of Sperner's theorem

József Balogh, Richard Mycroft, Andrew Treglown

Let $P (n)$ denote the power set of $[n]$ , ordered by inclusion, and let $P (n, p)$ be obtained from $P (n)$ by selecting elements from $P (n)$ i…

math.CO2014★ 2 cited

Packing k-partite k-uniform hypergraphs

Richard Mycroft

Let $G$ and $H$ be $k$ -graphs ( $k$ -uniform hypergraphs); then a perfect $H$ -packing in $G$ is a collection of vertex-disjoint copies of $H$ in $G$ which together cover every vertex…