Irreducible Factorization Lengths and the Elasticity Problem within ℕ. - Matthew Jenssen; Daniel Montealegre; Vadim Ponomarenko (Am. Math. Mon., 2013)

The Multicolour Ramsey Number of a Long Odd Cycle. - Matthew Jenssen (Electron. Notes Discret. Math., 2015)

Multicolour Ramsey numbers of paths and even cycles. - Ewan Davies; Matthew Jenssen; Barnaby Roberts (Eur. J. Comb., 2017)

Independent sets, matchings, and occupancy fractions. - Ewan Davies; Matthew Jenssen; Will Perkins 001; Barnaby Roberts (J. Lond. Math. Soc., 2017)

Tight bounds on the coefficients of partition functions via stability. - Ewan Davies; Matthew Jenssen; Will Perkins 001; Barnaby Roberts (J. Comb. Theory A, 2018)

Extremes of the internal energy of the Potts model on cubic graphs. - Ewan Davies; Matthew Jenssen; Will Perkins 001; Barnaby Roberts (Random Struct. Algorithms, 2018)

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)

Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. - Tyler Helmuth; Matthew Jenssen; Will Perkins 001 (CoRR, 2020)

The multicolour size-Ramsey number of powers of paths. - Jie Han 002; Matthew Jenssen; Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Barnaby Roberts (J. Comb. Theory B, 2020)

Algorithms for #BIS-Hard Problems on Expander Graphs. - Matthew Jenssen; Peter Keevash; Will Perkins 001 (SIAM J. Comput., 2020)

A proof of the upper matching conjecture for large graphs. - Ewan Davies; Matthew Jenssen; Will Perkins 001 (J. Comb. Theory B, 2021)

Quasipolynomial-time algorithms for repulsive Gibbs point processes. - Matthew Jenssen; Marcus Michelen; Mohan Ravichandran (CoRR, 2022)

Independent sets of a given size and structure in the hypercube. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi (Comb. Probab. Comput., 2022)

Approximately counting independent sets in bipartite graphs via graph containers. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi (Random Struct. Algorithms, 2023)

Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi; Michael Simkin (FOCS, 2024)

Sampling and counting triangle-free graphs near the critical density. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi; Michael Simkin (CoRR, 2024)

A refined graph container lemma and applications to the hard-core model on bipartite expanders. - Matthew Jenssen; Alexandru Malekshahian; Jinyoung Park (CoRR, 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 robust Corrádi-Hajnal theorem. - Peter Allen 001; Julia Böttcher; Jan Corsten; Ewan Davies; Matthew Jenssen; Patrick Morris 001; Barnaby Roberts; Jozef Skokan (Random Struct. Algorithms, 2024)

Quasipolynomial-time algorithms for Gibbs point processes. - Matthew Jenssen; Marcus Michelen; Mohan Ravichandran (Comb. Probab. Comput., 2024)