The following pages link to Allan Lo (Q322201):
Displaying 50 items.
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs (Q326810) (← links)
- A note on the minimum size of \(k\)-rainbow-connected graphs (Q397136) (← links)
- Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
- Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs (Q456311) (← links)
- On-line Ramsey numbers of paths and cycles (Q490318) (← links)
- A note on large rainbow matchings in edge-coloured graphs (Q742578) (← links)
- Density of monochromatic infinite paths (Q1627204) (← links)
- Hamilton cycles in sparse robustly expanding digraphs (Q1671669) (← links)
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs (Q1677578) (← links)
- Covering and tiling hypergraphs with tight cycles (Q1689974) (← links)
- Decomposing tournaments into paths (Q1690018) (← links)
- Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large (Q1753092) (← links)
- Minimum codegree threshold for \((K^3_4-e)\)-factors (Q1940381) (← links)
- Transitive triangle tilings in oriented graphs (Q1989953) (← links)
- Towards Lehel's conjecture for 4-uniform tight cycles (Q2111790) (← links)
- On a conjecture of Erdős on locally sparse Steiner triple systems (Q2216922) (← links)
- On the decomposition threshold of a given graph (Q2338634) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- Existences of rainbow matchings and rainbow matching covers (Q2352078) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Fractional clique decompositions of dense graphs and hypergraphs (Q2407383) (← links)
- Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs (Q2700970) (← links)
- Cliques in graphs with bounded minimum degree (Q2851457) (← links)
- Cliques in Graphs With Bounded Minimum Degree (Q2888872) (← links)
- ${\ell}$-Degree Turán Density (Q2935266) (← links)
- The robust component structure of dense regular graphs and applications (Q2940076) (← links)
- Constrained Ramsey numbers for rainbow matching (Q3005111) (← links)
- Triangles in Regular Graphs with Density Below One Half (Q3557499) (← links)
- Codegree Turán Density of Complete $r$-Uniform Hypergraphs (Q4563373) (← links)
- Long properly coloured cycles in edge‐coloured graphs (Q4630001) (← links)
- A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs (Q4903264) (← links)
- An Edge-Colored Version of Dirac's Theorem (Q4979820) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
- Decomposing tournaments into paths (Q5109414) (← links)
- Minimalist designs (Q5120741) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
- Exact Minimum Codegree Threshold for <i>K</i><sup>−</sup><sub>4</sub>-Factors (Q5373833) (← links)
- A Dirac Type Condition for Properly Coloured Paths and Cycles (Q5418769) (← links)
- (Q5419947) (← links)
- Proof of the $1$-factorization and Hamilton Decomposition Conjectures (Q5420009) (← links)
- Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree (Q5854457) (← links)
- Complete subgraphs in a multipartite graph (Q5886355) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5890900) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5899605) (← links)
- Path decompositions of tournaments (Q6075058) (← links)
- Hamilton cycles in dense regular digraphs and oriented graphs (Q6144396) (← links)
