The following pages link to Richard Mycroft (Q458288):
Displayed 26 items.
- A random version of Sperner's theorem (Q458289) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Loose Hamilton cycles in hypergraphs (Q629193) (← links)
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
- Hamilton \(\ell \)-cycles in uniform hypergraphs (Q986125) (← links)
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs (Q1627213) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- Spanning trees of dense directed graphs (Q2132400) (← links)
- Classification of maximum hittings by large families (Q2303424) (← links)
- A multipartite Hajnal-Szemerédi theorem (Q2349514) (← links)
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph (Q2400547) (← links)
- Hamilton cycles in quasirandom hypergraphs (Q2820275) (← links)
- (Q2857424) (← links)
- (Q2857428) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q3169283) (← links)
- Triangle-Tilings in Graphs Without Large Independent Sets (Q3177358) (← links)
- (Q4601890) (← links)
- Contagious sets in a degree‐proportional bootstrap percolation process (Q4625021) (← links)
- Unavoidable trees in tournaments (Q4684833) (← links)
- An Asymptotic Multipartite Kühn--Osthus Theorem (Q5275440) (← links)
- (Q5419956) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q5495801) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Trees and tree-like structures in dense digraphs (Q6356287) (← links)
- Removing induced powers of cycles from a graph via fewest edits (Q6445215) (← links)