Frank Mousset

According to our database, Frank Mousset authored at least 12 papers between 2012 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2022

Covering cycles in sparse graphs.

Frank Mousset, Nemanja Skoric, Milos Trujic

Random Struct. Algorithms, 2022

2020

A general lower bound for collaborative tree exploration.

Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger

Theor. Comput. Sci., 2020

Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties.

Frank Mousset, Rajko Nenadov, Wojciech Samotij

Comb. Probab. Comput., 2020

2019

Bootstrap percolation with inhibition.

Hafsteinn Einarsson, Johannes Lengler, Frank Mousset, Konstantinos Panagiotou, Angelika Steger

Random Struct. Algorithms, 2019

2018

Monochromatic cycle covers in random graphs.

Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov

Random Struct. Algorithms, 2018

The Minrank of Random Graphs over Arbitrary Fields.

Noga Alon, Igor Balla, Lior Gishboliner, Adva Mond, Frank Mousset

CoRR, 2018

Vertex Covering with Monochromatic Pieces of few Colours.

Marlo Eugster, Frank Mousset

Electron. J. Comb., 2018

2017

A tight Erdős-Pósa function for long cycles.

Frank Mousset, Andreas Noever, Nemanja Skoric, Felix Weissenberger

J. Comb. Theory B, 2017

Smaller Subgraphs of Minimum Degree $k$.

Frank Mousset, Andreas Noever, Nemanja Skoric

Electron. J. Comb., 2017

Stability for Vertex Cycle Covers.

József Balogh, Frank Mousset, Jozef Skokan

Electron. J. Comb., 2017

2014

On the Number of Graphs Without Large Cliques.

Frank Mousset, Rajko Nenadov, Angelika Steger

SIAM J. Discret. Math., 2014

2012

On Rainbow Cycles and Paths

Heidi Gebauer, Frank Mousset

CoRR, 2012