20 citations · 71 across the 33 of their papers we have counts for
4 papers · 1 filter
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…
A density Corrádi-Hajnal Theorem
Peter Allen, Julia Böttcher, Jan Hladký +1
We find, for all sufficiently large and each , the maximum number of edges in an -vertex graph which does not contain vertex-disjoint triangles. This extends a resu…
An extension of Turán's Theorem, uniqueness and stability
Peter Allen, Julia Böttcher, Jan Hladký +1
We determine the maximum number of edges of an -vertex graph with the property that none of its -cliques intersects a fixed set . For , the…
Powers of Hamilton cycles in pseudorandom graphs
Peter Allen, Julia Böttcher, Hiep Hàn +2
We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph is …