Matthew Jenssen

activity

20152026

most citedOn the average size of independent sets in triangle-free graphs

41 citations · 162 across the 24 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 2 cited

The multicolour size-Ramsey number of powers of paths

Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa +2

Given a positive integer $s$ , a graph $G$ is $s$ -Ramsey for a graph $H$ , denoted $G \to (H)_{s}$ , if every $s$ -colouring of the edges of $G$ contains a monochromatic copy of $…

cs.DS2018★ 2 cited

Algorithms for #BIS-hard problems on expander graphs

Matthew Jenssen, Peter Keevash, Will Perkins

We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts m…

math.MG2018

On kissing numbers and spherical codes in high dimensions

Matthew Jenssen, Felix Joos, Will Perkins

We prove a lower bound of $Ω (d^{3/2} \cdot (2/ 3)^{d})$ on the kissing number in dimension $d$ . This improves the classical lower bound of Chabauty, Shannon, and Wyner by a lin…