Arran Hamm

activity

20122018

most citedUsing Block Designs in Crossing Number Bounds

2 citations · 4 across the 6 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

math.CO2014

On Erdős-Ko-Rado for random hypergraphs I

Arran Hamm, Jeff Kahn

A family of sets is intersecting if no two of its members are disjoint, and has the Erdős-Ko-Rado property (or is EKR) if each of its largest intersecting subfamilies has nonempty…

math.CO2014

On Erdős-Ko-Rado for random hypergraphs II

Arran Hamm, Jeff Kahn

Denote by $H_{k} (n, p)$ the random $k$ -graph in which each $k$ -subset of ${1... n}$ is present with probability $p$ , independent of other choices. More or less answering…