64 citations · 285 across the 44 of their papers we have counts for
47 papers
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
Deepak Bal, Louis DeBiasio, Allan Lo
The -color size-Ramsey number of a -uniform hypergraph , denoted by , is the minimum number of edges in a -uniform hypergraph such that for every -…
An oriented discrepancy version of Dirac's theorem
Andrea Freschi, Allan Lo
The study of graph discrepancy problems, initiated by Erdős in the 1960s, has received renewed attention in recent years. In general, given a -edge-coloured graph , one is in…
Cycle decompositions in -uniform hypergraphs
Allan Lo, Simón Piga, Nicolás Sanhueza-Matamala
We show that -uniform hypergraphs on vertices whose codegree is at least can be decomposed into tight cycles, subject to the trivial divisibility conditions.…
Hamilton Cycles in Dense Regular Digraphs and Oriented Graphs
Allan Lo, Viresh Patel, Mehmet Akif Yıldız
We prove that for every there exists such that every regular oriented graph on vertices and degree at least $(1/4 + \varepsilon)n…
Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs
A. Nicholas Day, Allan Lo
The upper density of an infinite graph with is defined as . Let $K…
The Ramsey number for 4-uniform tight cycles
Allan Lo, Vincent Pfenninger
A -uniform tight cycle is a -graph with a cyclic ordering of its vertices such that its edges are precisely the sets of consecutive vertices in that ordering. A -unifo…