1 citations · 1 across the 7 of their papers we have counts for
4 papers · 1 filter
Blowing up Dirac's theorem
Richard Lang, Nicolás Sanhueza-Matamala
We show that every graph on vertices with is spanned by a complete blow-up of a cycle with clusters of nearly uniform size . The p…
A hypergraph bandwidth theorem
Richard Lang, Nicolás Sanhueza-Matamala
A cornerstone of extremal graph theory due to Erdős and Stone states that the edge density which guarantees a fixed graph as subgraph also asymptotically guarantees a blow-up o…
Colour-bias perfect matchings in hypergraphs
Hiêp Hàn, Richard Lang, João Pedro Marciano +4
We study conditions under which an edge-coloured hypergraph has a particular substructure that contains more than the trivially guaranteed number of monochromatic edges. Our main r…
Spanning spheres in Dirac hypergraphs
Freddie Illingworth, Richard Lang, Alp Müyesser +2
We show that a -uniform hypergraph on vertices has a spanning subgraph homeomorphic to the -dimensional sphere provided that has no isolated vertices and each s…