Minimal Weight in Union-Closed Families. - Victor Falgas-Ravry (Electron. J. Comb., 2011)

Turán H-Densities for 3-Graphs. - Victor Falgas-Ravry; Emil R. Vaughan (Electron. J. Comb., 2012)

On the Codegree Density of Complete 3-Graphs and Related Problems. - Victor Falgas-Ravry (Electron. J. Comb., 2013)

Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs. - Victor Falgas-Ravry; Emil R. Vaughan (Comb. Probab. Comput., 2013)

Sperner's Problem for G-Independent Families. - Victor Falgas-Ravry (Comb. Probab. Comput., 2015)

The Codegree Threshold for 3-Graphs with Independent Neighborhoods. - Victor Falgas-Ravry; Edward Marchant; Oleg Pikhurko; Emil R. Vaughan (SIAM J. Discret. Math., 2015)

Random Subcube Intersection Graphs I: Cliques and Covering. - Victor Falgas-Ravry; Klas Markström (Electron. J. Comb., 2016)

Speed and concentration of the covering time for structured coupon collectors. - Victor Falgas-Ravry; Joel Larsson; Klas Markström (CoRR, 2016)

Codegree Thresholds for Covering 3-Uniform Hypergraphs. - Victor Falgas-Ravry; Yi Zhao 005 (SIAM J. Discret. Math., 2016)

The codegree threshold of K4-. - Victor Falgas-Ravry; Oleg Pikhurko; Emil R. Vaughan; Jan Volec (Electron. Notes Discret. Math., 2017)

Subgraphs with Large Minimum ℓ-Degree in Hypergraphs where Almost All ℓ-Degrees are Large. - Victor Falgas-Ravry; Allan Lo (Electron. J. Comb., 2018)

Full subgraphs. - Victor Falgas-Ravry; Klas Markström; Jacques Verstraëte (J. Graph Theory, 2018)

Triangle-degrees in graphs and tetrahedron coverings in 3-graphs. - Victor Falgas-Ravry; Klas Markström; Yi Zhao 005 (CoRR, 2019)

Multicolor containers, extremal entropy, and counting. - Victor Falgas-Ravry; Kelly O'Connell; Andrew J. Uzzell (Random Struct. Algorithms, 2019)

Long paths and connectivity in 1-independent random graphs. - A. Nicholas Day; Victor Falgas-Ravry; Robert Hancock 002 (Random Struct. Algorithms, 2020)

Existence thresholds and Ramsey properties of random posets. - Victor Falgas-Ravry; Klas Markström; Andrew Treglown; Yi Zhao 005 (Random Struct. Algorithms, 2020)

Maker-Breaker percolation games I: crossing grids. - A. Nicholas Day; Victor Falgas-Ravry (Comb. Probab. Comput., 2021)

Maker-breaker percolation games II: Escaping to infinity. - A. Nicholas Day; Victor Falgas-Ravry (J. Comb. Theory B, 2021)

Extremal problems for multigraphs. - A. Nicholas Day; Victor Falgas-Ravry; Andrew Treglown (J. Comb. Theory B, 2022)

Square percolation and the threshold for quadratic divergence in random right-angled Coxeter groups. - Jason A. Behrstock; Victor Falgas-Ravry; Tim Susse (Random Struct. Algorithms, 2022)

1-independent percolation on ℤ 2 × K n. - Victor Falgas-Ravry; Vincent Pfenninger (Random Struct. Algorithms, 2023)

Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers. - Victor Falgas-Ravry; Robert Hancock 002; Johanna Strömberg; Andrew J. Uzzell (J. Graph Theory, 2023)

On Density Conditions for Transversal Trees in Multipartite Graphs. - Leila Badakhshian; Victor Falgas-Ravry; Maryam Sharifzadeh (Electron. J. Comb., 2024)

On an extremal problem for locally sparse multigraphs. - Victor Falgas-Ravry (Eur. J. Comb., 2024)

Minimum-degree conditions for rainbow triangles. - Victor Falgas-Ravry; Klas Markström; Eero Räty (J. Graph Theory, 2024)

Rainbow Variations on a Theme by Mantel: Extremal Problems for Gallai Colouring Templates. - Victor Falgas-Ravry; Klas Markström; Eero Räty (Comb., 2024)

A note on locating-dominating sets in twin-free graphs. - Nicolas Bousquet 001; Quentin Chuet; Victor Falgas-Ravry; Amaury Jacques; Laure Morelle (Discret. Math., 2025)