Matthew Jenssen

According to our database1, Matthew Jenssen authored at least 10 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Algorithms for #BIS-Hard Problems on Expander Graphs.
SIAM J. Comput., 2020

The multicolour size-Ramsey number of powers of paths.
J. Comb. Theory, Ser. B, 2020

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

2019
The size?Ramsey number of powers of paths.
J. Graph Theory, 2019

2018
Extremes of the internal energy of the Potts model on cubic graphs.
Random Struct. Algorithms, 2018

2017
Independent sets, matchings, and occupancy fractions.
J. Lond. Math. Soc., 2017

Tight bounds on the coefficients of partition functions via stability.
Electron. Notes Discret. Math., 2017

Multicolour Ramsey numbers of paths and even cycles.
Eur. J. Comb., 2017

2015
The Multicolour Ramsey Number of a Long Odd Cycle.
Electron. Notes Discret. Math., 2015

2013
Irreducible Factorization Lengths and the Elasticity Problem within ℕ.
Am. Math. Mon., 2013


  Loading...