Matthew Jenssen

26 papers A* 3Journal 23
YearRankTypeTitle / Venue / Authors
2024 J jnl
A refined graph container lemma and applications to the hard-core model on bipartite expanders.
CoRR
Matthew Jenssen, Alexandru Malekshahian, Jinyoung Park
2024 J jnl
A robust Corrádi-Hajnal theorem.
Random Struct. Algorithms
Peter Allen, Julia Böttcher, Jan Corsten, Ewan Davies, Matthew Jenssen, Patrick Morris, Barnaby Roberts, Jozef Skokan
2024 J jnl
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem.
J. Comb. Theory B
Matthew Jenssen, Viresh Patel, Guus Regts
2024 J jnl
Quasipolynomial-time algorithms for Gibbs point processes.
Comb. Probab. Comput.
Matthew Jenssen, Marcus Michelen, Mohan Ravichandran
2024 J jnl
Sampling and counting triangle-free graphs near the critical density.
CoRR
Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin
2024 A* conf
Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density.
FOCS
Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin
2023 J jnl
Approximately counting independent sets in bipartite graphs via graph containers.
Random Struct. Algorithms
Matthew Jenssen, Will Perkins, Aditya Potukuchi
2023 J jnl
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem.
CoRR
Matthew Jenssen, Viresh Patel, Guus Regts
2022 A* conf
Approximately counting independent sets in bipartite graphs via graph containers.
SODA
Matthew Jenssen, Aditya Potukuchi, Will Perkins
2022 J jnl
Independent sets of a given size and structure in the hypercube.
Comb. Probab. Comput.
Matthew Jenssen, Will Perkins, Aditya Potukuchi
2022 J jnl
Quasipolynomial-time algorithms for repulsive Gibbs point processes.
CoRR
Matthew Jenssen, Marcus Michelen, Mohan Ravichandran
2021 J jnl
A proof of the upper matching conjecture for large graphs.
J. Comb. Theory B
Ewan Davies, Matthew Jenssen, Will Perkins
2021 J jnl
Approximately counting independent sets in bipartite graphs via graph containers.
CoRR
Matthew Jenssen, Will Perkins, Aditya Potukuchi
2020 J jnl
Algorithms for #BIS-Hard Problems on Expander Graphs.
SIAM J. Comput.
Matthew Jenssen, Peter Keevash, Will Perkins
2020 J jnl
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs.
CoRR
Tyler Helmuth, Matthew Jenssen, Will Perkins
2020 J jnl
The multicolour size-Ramsey number of powers of paths.
J. Comb. Theory B
Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts
2019 A* conf
Algorithms for #BIS-hard problems on expander graphs.
SODA
Matthew Jenssen, Peter Keevash, Will Perkins
2019 J jnl
The size?Ramsey number of powers of paths.
J. Graph Theory
Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts
2018 J jnl
Algorithms for #BIS-hard problems on expander graphs.
CoRR
Matthew Jenssen, Peter Keevash, Will Perkins
2018 J jnl
Extremes of the internal energy of the Potts model on cubic graphs.
Random Struct. Algorithms
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
2018 J jnl
Tight bounds on the coefficients of partition functions via stability.
J. Comb. Theory A
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
2017 J jnl
Independent sets, matchings, and occupancy fractions.
J. Lond. Math. Soc.
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
2017 J jnl
Multicolour Ramsey numbers of paths and even cycles.
Eur. J. Comb.
Ewan Davies, Matthew Jenssen, Barnaby Roberts
2017 J jnl
Tight bounds on the coefficients of partition functions via stability.
Electron. Notes Discret. Math.
Ewan Davies, Matthew Jenssen, Barnaby Roberts, Will Perkins
2015 J jnl
The Multicolour Ramsey Number of a Long Odd Cycle.
Electron. Notes Discret. Math.
Matthew Jenssen
2013 J jnl
Irreducible Factorization Lengths and the Elasticity Problem within ℕ.
Am. Math. Mon.
Matthew Jenssen, Daniel Montealegre, Vadim Ponomarenko