Sammy Luo

activity

20242026

collaborators

4 papers

math.CO2026

Monochromatic components with many edges in random graphs

Hannah Fox, Sammy Luo

In an $r$ -coloring of edges of the complete graph on $n$ vertices, how many edges are there in the largest monochromatic connected component? A construction of GyÃ¡rfÃ¡s shows that…

math.CO2025

Iterated sumset expansion in $F_{p}^{n}$

Manik Dhar, Sammy Luo

Given a set $A \subseteq F_{p}^{n}$ , what conditions does one need to guarantee that iterated sumsets of the form $A + \dots + A$ expand quickly (say, within $O (p)$ terms) to the…

math.CO2025

At most 10 cylinders mutually touch: a Ramsey-theoretic approach

Travis Dillon, Junnosuke Koizumi, Sammy Luo

Littlewood asked for the maximum number $N$ of congruent infinite cylinders that can be arranged in $R^{3}$ so that every pair touches. We improve upon the proof of the seco…

math.CO2024

On off-diagonal $F$ -Ramsey numbers

Sammy Luo, Zixuan Xu

A graph is $(t_{1}, t_{2})$ -Ramsey if any red-blue coloring of its edges contains either a red copy of $K_{t_{1}}$ or a blue copy of $K_{t_{2}}$ . The size Ramsey number is the minimum numb…

Monochromatic components with many edges in random graphs

Iterated sumset expansion in Fpn​

At most 10 cylinders mutually touch: a Ramsey-theoretic approach

On off-diagonal F-Ramsey numbers

Iterated sumset expansion in $F_{p}^{n}$

On off-diagonal $F$ -Ramsey numbers