1 citations · 1 across the 7 of their papers we have counts for
7 papers
Spanning Components and Surfaces Under Minimum Vertex Degree
Jack Allsop, Ander Lamaison, Richard Lang +1
We study minimum vertex-degree conditions in 3-uniform hypergraphs for (tight) spanning components and (combinatorial) surfaces. Our main results show that a 3-uniform hypergraph $…
Loose Hamiltonicity
Richard Lang, Nicolás Sanhueza-Matamala
We study the appearance of Hamilton -cycles in dense -uniform hypergraphs when and does not divide . Our main result reduces this problem to th…
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…
Robust Hamiltonicity
Felix Joos, Richard Lang, Nicolás Sanhueza-Matamala
We study conditions under which a given hypergraph is randomly robust Hamiltonian, which means that a random sparsification of the host graph contains a Hamilton cycle with high pr…