Pascal Su

activity

20172020

most citedAn O(n) time algorithm for finding Hamilton cycles with high probability

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

collaborators

Showing 2018Show all

1 paper · 1 filter

math.CO2018

Improved bounds on the multicolor Ramsey numbers of paths and even cycles

Charlotte Knierim, Pascal Su

We study the multicolor Ramsey numbers for paths and even cycles, $R_{k} (P_{n})$ and $R_{k} (C_{n})$ , which are the smallest integers $N$ such that every coloring of the complete graph $K_N…