Y. Leung

collaborators

2 papers

math.CO2025

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O (n lo g lo g lo g n)$ time

Yui Hin Arvin Leung

The Erdős-Ginzburg-Ziv theorem states that for any sequence of $2 n - 1$ integers, there exists a subsequence of $n$ elements whose sum is divisible by $n$ . In this article, we provid…

math.CO2023

Graphs with queue number three and unbounded stack number

Yui Hin Arvin Leung

We prove that the graphs $T\boxslash P$ have unbounded stack number and queue number $3$ , where $T$ is a tree and $P$ is a path, and $\boxslash$ denotes the graph strong product bu…

Finding a solution to the Erdős-Ginzburg-Ziv theorem in O(nlogloglogn) time

Graphs with queue number three and unbounded stack number

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O (n lo g lo g lo g n)$ time