Frank Mousset

activity

20122026

most citedOn the number of graphs without large cliques

14 citations · 45 across the 11 of their papers we have counts for

collaborators

19 papers

math.PR2026

Upper tails for irregular graphs beyond the mean-field regime

Asaf Cohen Antonir, Matan Harel, Frank Mousset +1

Let $G_{n, p}$ be the binomial random graph of density $p$ and let $X_{H}$ be the number of copies of a fixed graph $H$ in $G_{n, p}$ . We prove asymptotically tight bounds on the logar…

math.PR2024

Upper tails for arithmetic progressions revisited

Matan Harel, Frank Mousset, Wojciech Samotij

Let $X$ be the number of $k$ -term arithmetic progressions contained in the $p$ -biased random subset of the first $N$ positive integers. We give asymptotically sharp estimates on th…

math.CO2020

Covering cycles in sparse graphs

Frank Mousset, Nemanja Škorić, Miloš Trujić

Let $k \geq 2$ be an integer. Kouider and Lonc proved that the vertex set of every graph $G$ with $n \geq n_{0} (k)$ vertices and minimum degree at least $n / k$ can be covered by $k -…

math.PR2019★ 3 cited

Upper tails via high moments and entropic stability

Matan Harel, Frank Mousset, Wojciech Samotij

Suppose that $X$ is a bounded-degree polynomial with nonnegative coefficients on the $p$ -biased discrete hypercube. Our main result gives sharp estimates on the logarithmic upper t…

math.CO2018★ 5 cited

The edge-statistics conjecture for $ℓ ≪ k^{6/5}$

Anders Martinsson, Frank Mousset, Andreas Noever +1

Let $k$ and $ℓ$ be positive integers. We prove that if $1 \leq ℓ \leq o_{k} (k^{6/5})$ , then in every large enough graph $G$ , the fraction of $k$ -vertex subsets that induce exac…

math.CO2018

The Minrank of Random Graphs over Arbitrary Fields

Noga Alon, Igor Balla, Lior Gishboliner +2

The minrank of a graph $G$ on the set of vertices $[n]$ over a field $F$ is the minimum possible rank of a matrix $M \in F^{n \times n}$ with nonzero diagonal entrie…