Pascal Su

activity

20172019

collaborators

Showing math.COShow all

3 papers · 1 filter

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…

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…

The Chromatic Number of Dense Random Block Graphs

Kr​-Factors in Graphs with Low Independence Number

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

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