Tony W. H. Wong

most citedPaired

(n - 1)

-to-

(n - 1)

disjoint path covers in bipartite transposition-like graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.NT2025

A further investigation on covering systems with odd moduli

Chris Bispels, Matthew Cohen, Joshua Harrington +4

Erdős first introduced the idea of covering systems in 1950. Since then, much of the work in this area has concentrated on identifying covering systems that meet specific condition…

math.NT2025

On Sierpiński and Riesel Repdigits and Repintegers

Chris Bispels, Matthew Cohen, Joshua Harrington +4

For positive integers $b \geq 2$ , $k < b$ , and $t$ , we say that an integer $k_{b}^{(t)}$ is a $b$ -repdigit if $k_{b}^{(t)}$ can be expressed as the digit $k$ repeated $t$ times in base-$b…

math.CO2024★ 1 cited

Paired $(n - 1)$ -to- $(n - 1)$ disjoint path covers in bipartite transposition-like graphs

Anna Coleman, Gabrielle Fischberg, Charles Gong +2

A paired $k$ -to- $k$ disjoint path cover of a graph $G$ is a collection of pairwise disjoint path subgraphs $P_{1}, P_{2}, \dots, P_{k}$ such that each $P_{i}$ has prescribed vertices $s_{i}$ a…

A further investigation on covering systems with odd moduli

On Sierpiński and Riesel Repdigits and Repintegers

Paired (n−1)-to-(n−1) disjoint path covers in bipartite transposition-like graphs

Paired $(n - 1)$ -to- $(n - 1)$ disjoint path covers in bipartite transposition-like graphs