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

4 papers · 1 filter

math.PR2020

Singularity of random symmetric matrices revisited

Marcelo Campos, Matthew Jenssen, Marcus Michelen +1

Let $M_{n}$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_{n}$ is singular is at most $exp (- c (n lo g n)^{1/2})$ , which repre…

math.CO2020

Homomorphisms from the torus

Matthew Jenssen, Peter Keevash

We present a detailed probabilistic and structural analysis of the set of weighted homomorphisms from the discrete torus $Z_{m}^{n}$ , where $m$ is even, to any fixed graph: we…

math.PR2020★ 2 cited

Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs

Tyler Helmuth, Matthew Jenssen, Will Perkins

For $Δ \geq 5$ and $q$ large as a function of $Δ$ , we give a detailed picture of the phase transition of the random cluster model on random $Δ$ -regular graphs. In particular, we dete…

math.CO2020

A proof of the Upper Matching Conjecture for large graphs

Ewan Davies, Matthew Jenssen, Will Perkins

We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markström and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enoug…