Pascal Su

activity

20172019

collaborators

3 papers

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$ …

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…

cs.DS2017

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes

Fabian Kuhn, Konstantinos Panagiotou, Pascal Su

We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a giv…

Kr​-Factors in Graphs with Low Independence Number

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

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes

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