Matthew Jenssen

activity

20152026

most citedOn the average size of independent sets in triangle-free graphs

41 citations · 162 across the 24 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.DS2021

Approximately counting independent sets in bipartite graphs via graph containers

Matthew Jenssen, Will Perkins, Aditya Potukuchi

By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first…

math.PR2021★ 1 cited

The singularity probability of a random symmetric matrix is exponentially small

Marcelo Campos, Matthew Jenssen, Marcus Michelen +1

Let $A$ be drawn uniformly at random from the set of all $n \times n$ symmetric matrices with entries in ${- 1, 1}$ . We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where…

math.CO2021

Independent sets of a given size and structure in the hypercube

Matthew Jenssen, Will Perkins, Aditya Potukuchi

We determine the asymptotics of the number of independent sets of size $⌊ β 2^{d - 1} ⌋$ in the discrete hypercube $Q_{d} = {0, 1}^{d}$ for any fixed $β \in [0, 1]$ as $d \to \…