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

1 paper · 1 filter

math.CO2019

$K_{r}$ -Factors in Graphs with Low Independence Number

Charlotte Knierim, Pascal Su

A classical result by Hajnal and Szemerédi from 1970 determines the minimal degree conditions necessary to guarantee for a graph to contain a $K_{r}$ -factor. Namely, any graph on $n$ …

Kr​-Factors in Graphs with Low Independence Number

$K_{r}$ -Factors in Graphs with Low Independence Number