Matthew Jenssen

According to our database, Matthew Jenssen authored at least 20 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Quasipolynomial-time algorithms for Gibbs point processes.

Matthew Jenssen, Marcus Michelen, Mohan Ravichandran

Comb. Probab. Comput., January, 2024

A robust Corrádi-Hajnal theorem.

Peter Allen, Julia Böttcher, Jan Corsten, Ewan Davies, Matthew Jenssen, Patrick Morris, Barnaby Roberts, Jozef Skokan

Random Struct. Algorithms, 2024

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem.

Matthew Jenssen, Viresh Patel, Guus Regts

J. Comb. Theory B, 2024

A refined graph container lemma and applications to the hard-core model on bipartite expanders.

Matthew Jenssen, Alexandru Malekshahian, Jinyoung Park

CoRR, 2024

Sampling and counting triangle-free graphs near the critical density.

Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin

CoRR, 2024

Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density.

Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2022

Independent sets of a given size and structure in the hypercube.

Matthew Jenssen, Will Perkins, Aditya Potukuchi

Comb. Probab. Comput., 2022

Quasipolynomial-time algorithms for repulsive Gibbs point processes.

Matthew Jenssen, Marcus Michelen, Mohan Ravichandran

CoRR, 2022

Approximately counting independent sets in bipartite graphs via graph containers.

Matthew Jenssen, Aditya Potukuchi, Will Perkins

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

A proof of the upper matching conjecture for large graphs.

Ewan Davies, Matthew Jenssen, Will Perkins

J. Comb. Theory B, 2021

2020

The multicolour size-Ramsey number of powers of paths.

Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts

J. Comb. Theory B, 2020

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

Tyler Helmuth, Matthew Jenssen, Will Perkins

CoRR, 2020

2019

The size?Ramsey number of powers of paths.

Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts

J. Graph Theory, 2019

Algorithms for #BIS-hard problems on expander graphs.

Matthew Jenssen, Peter Keevash, Will Perkins

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Extremes of the internal energy of the Potts model on cubic graphs.

Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts

Random Struct. Algorithms, 2018

2017

Independent sets, matchings, and occupancy fractions.

Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts

J. Lond. Math. Soc., 2017

Tight bounds on the coefficients of partition functions via stability.

Ewan Davies, Matthew Jenssen, Barnaby Roberts, Will Perkins

Electron. Notes Discret. Math., 2017

Multicolour Ramsey numbers of paths and even cycles.

Ewan Davies, Matthew Jenssen, Barnaby Roberts

Eur. J. Comb., 2017

2015

The Multicolour Ramsey Number of a Long Odd Cycle.

Matthew Jenssen

Electron. Notes Discret. Math., 2015

2013

Irreducible Factorization Lengths and the Elasticity Problem within ℕ.

Matthew Jenssen, Daniel Montealegre, Vadim Ponomarenko

Am. Math. Mon., 2013