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

Showing 2018 · math.COShow all

3 papers · 2 filters

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…

math.CO2018★ 1 cited

Towards the Kohayakawa--Kreuter conjecture on asymmetric Ramsey properties

Frank Mousset, Rajko Nenadov, Wojciech Samotij

For fixed graphs $F_{1}, \dots, F_{r}$ , we prove an upper bound on the threshold function for the property that $G (n, p) \to (F_{1}, \dots, F_{r})$ . This establishes the $1$ -statement of a co…

The edge-statistics conjecture for ℓ≪k6/5

The Minrank of Random Graphs over Arbitrary Fields

Towards the Kohayakawa--Kreuter conjecture on asymmetric Ramsey properties

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