Pascal Su

activity

20152020

most citedBipartite Kneser graphs are Hamiltonian

34 citations · 40 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2020

Mastermind with a Linear Number of Queries

Anders Martinsson, Pascal Su

Since the 1960s Mastermind has been studied for the combinatorial and information theoretical interest the game has to offer. Many results have been discovered starting with Erdős…

math.CO2020★ 3 cited

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★ 1 cited

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

math.CO2015★ 34 cited

Bipartite Kneser graphs are Hamiltonian

Torsten Mütze, Pascal Su

For integers $k \geq 1$ and $n \geq 2 k + 1$ the Kneser graph $K (n, k)$ has as vertices all $k$ -element subsets of $[n] := {1, 2, \dots, n}$ and an edge between any two vertices (=sets) th…