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

3 papers · 1 filter

math.CO2017

The size-Ramsey number of powers of paths

Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa +4

Given graphs $G$ and $H$ and a positive integer $q$ say that $G$ is $q$ -Ramsey for $H$ , denoted $G \to (H)_{q}$ , if every $q$ -colouring of the edges of $G$ contains a monochro…

math.PR2017★ 32 cited

On the hard sphere model and sphere packings in high dimensions

Matthew Jenssen, Felix Joos, Will Perkins

We prove a lower bound on the entropy of sphere packings of $R^{d}$ of density $Θ (d \cdot 2^{- d})$ . The entropy measures how plentiful such packings are, and our result is si…

math.CO2017★ 3 cited

Tight bounds on the coefficients of partition functions via stability

Ewan Davies, Matthew Jenssen, Will Perkins +1

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. Fo…