Charles Gong

most citedPaired

(n - 1)

-to-

(n - 1)

disjoint path covers in bipartite transposition-like graphs

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

collaborators

5 papers

math.CO2025

Three Generalizations of Erdős Szekeres: $k$ -Modal Subsequences

Charles Gong

Erdős and Szekeres showed that given a permutation $p$ of $[n]$ , and the sequence defined by \newline $(p (1), p (2), \dots, p (n))$ , there exists either a decreasing or increasing s…

math.CO2024

Properties of Sub-Add Move Graphs

Patrick Cesarz, Eugene Fiorini, Charles Gong +3

We introduce the notion of a move graph, that is, a directed graph whose vertex set is a $Z$ -module $Z_{n}^{m}$ , and whose arc set is uniquely determined by the action…

math.CO2024

Slitherlink on Triangular Grids

Charles Gong

Let $G$ be a plane graph and let $C$ be a cycle in $G$ . For each finite face of $G$ , count the number of edges of $C$ the face contains. We call this the Slitherlink signature of $…

math.CO2024

Minimizing Monochromatic Subgraphs of $K_{n, n}$

Charles Gong

Given any $r$ -edge coloring of $K_{n, n}$ , how large is the maximum (over all $r$ colors) sized monochromatic subgraph guaranteed to be? We give answers to this problem for $r \leq…

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…

Three Generalizations of Erdős Szekeres: k-Modal Subsequences

Properties of Sub-Add Move Graphs

Slitherlink on Triangular Grids

Minimizing Monochromatic Subgraphs of Kn,n​

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

Three Generalizations of Erdős Szekeres: $k$ -Modal Subsequences

Minimizing Monochromatic Subgraphs of $K_{n, n}$

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