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 2020Show all

2 papers · 1 filter

cs.DS2020★ 2 cited

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

Rajko Nenadov, Angelika Steger, Pascal Su

We design a randomized algorithm that finds a Hamilton cycle in $O (n)$ time with high probability in a random graph $G_{n, p}$ with edge probability $p \geq C lo g n / n$ . T…

math.CO2020

The Chromatic Number of Dense Random Block Graphs

Anders Martinsson, Konstantinos Panagiotou, Pascal Su +1

The chromatic number $χ (G)$ of a graph $G$ , that is, the smallest number of colors required to color the vertices of $G$ so that no two adjacent vertices are assigned the same colo…