I agree that this site is using cookies. You can find further informations here.
X
Jenssen, Matthew
67  results:
Search for persons X
?
1

A robust Corrádi–Hajnal theorem:

Allen, Peter ; Böttcher, Julia ; Corsten, Jan...
Random Structures & Algorithms.  65 (2024)  1 - p. 61-130 , 2024
Link: https://doi.org/10.1002/..
 
?
2

The least singular value of a random symmetric matrix:

Campos, Marcelo ; Jenssen, Matthew ; Michelen, Marcus.
Forum of Mathematics, Pi.  12 (2024)  - p. , 2024
Link: https://doi.org/10.1017/..
 
?
3

The Cluster Expansion in Combinatorics:

, In: Surveys in Combinatorics 2024,
Jenssen, Matthew - p. 55-88 , 2024
Link: https://doi.org/10.1017/..
 
?
4

Improved bounds for the zeros of the chromatic polynomial v..:

Jenssen, Matthew ; Patel, Viresh ; Regts, Guus
Journal of Combinatorial Theory, Series B.  169 (2024)  - p. 233-252 , 2024
Link: https://doi.org/10.1016/..
 
?
5

Quasipolynomial-time algorithms for Gibbs point processes:

Jenssen, Matthew ; Michelen, Marcus ; Ravichandran, Mohan
Combinatorics, Probability and Computing.  33 (2023)  1 - p. 1-15 , 2023
Link: https://doi.org/10.1017/..
 
?
6

Approximately counting independent sets in bipartite graphs..:

Jenssen, Matthew ; Perkins, Will ; Potukuchi, Aditya
Random Structures & Algorithms.  63 (2023)  1 - p. 215-241 , 2023
Link: https://doi.org/10.1002/..
 
?
7

Homomorphisms from the torus:

Jenssen, Matthew ; Keevash, Peter
Advances in Mathematics.  430 (2023)  - p. 109212 , 2023
Link: https://doi.org/10.1016/..
 
?
8

Independent sets of a given size and structure in the hyper..:

Jenssen, Matthew ; Perkins, Will ; Potukuchi, Aditya
Combinatorics, Probability and Computing.  31 (2022)  4 - p. 702-720 , 2022
Link: https://doi.org/10.1017/..
 
?
9

A proof of the upper matching conjecture for large graphs:

Davies, Ewan ; Jenssen, Matthew ; Perkins, Will
Journal of Combinatorial Theory, Series B.  151 (2021)  - p. 393-416 , 2021
Link: https://doi.org/10.1016/..
 
?
10

Exact Ramsey numbers of odd cycles via nonlinear optimisati..:

Jenssen, Matthew ; Skokan, Jozef
Advances in Mathematics.  376 (2021)  - p. 107444 , 2021
Link: https://doi.org/10.1016/..
 
?
11

Independent sets in the hypercube revisited:

Jenssen, Matthew ; Perkins, Will
Journal of the London Mathematical Society.  102 (2020)  2 - p. 645-669 , 2020
Link: https://doi.org/10.1112/..
 
?
12

Algorithms for #BIS-Hard Problems on Expander Graphs:

Jenssen, Matthew ; Keevash, Peter ; Perkins, Will
SIAM Journal on Computing.  49 (2020)  4 - p. 681-710 , 2020
Link: https://doi.org/10.1137/..
 
?
13

The multicolour size-Ramsey number of powers of paths:

Han, Jie ; Jenssen, Matthew ; Kohayakawa, Yoshiharu..
Journal of Combinatorial Theory, Series B.  145 (2020)  - p. 359-375 , 2020
Link: https://doi.org/10.1016/..
 
?
14

Algorithms for #BIS-hard problems on expander graphs:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Jenssen, Matthew ; Keevash, Peter ; Perkins, Will - p. 2235-2247 , 2019
Link: https://dl.acm.org/doi/1..
 
?
15

ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENS..:

JENSSEN, MATTHEW ; JOOS, FELIX ; PERKINS, WILL
Forum of Mathematics, Sigma.  7 (2019)  - p. , 2019
Link: https://doi.org/10.1017/..
 
1-15