Victor Falgas-ravry

activity

20242026

collaborators

6 papers

math.CO2026

The threshold for the asymmetric vertex-Ramsey property in randomly perturbed graphs

Asier Calbet, Victor Falgas-Ravry, Joseph Hyde

For $r \geq 2$ and graphs $H_{1}, \dots, H_{r}, G$ , we say that $G$ is $(H_{1}, \dots, H_{r})$ vertex-Ramsey, or $(H_{1}, \dots, H_{r})_{v}$ -Ramsey, if whenever we colour the vertices of $G$ …

math.CO2026

Induced poset saturation in the hypergrid

R. Altar Ciceksiz, Victor Falgas-Ravry, Sabrina Lato +1

Set $[n] = {1, 2, \dots, n}$ . The hypergrid $[t]^{n}$ is the collection of functions $f : [n] \to [t]$ . We equip it with the natural partial order by letting $f \leq g$ when…

math.GR2025

A threshold for relative hyperbolicity in random right-angled Coxeter groups

Jason Behrstock, Recep Altar Ciceksiz, Victor Falgas-Ravry

We consider the random right-angled Coxeter group $W_{I^} $ whose presentation graph $I^ \sim G_{n, p}$ is an Erd{\H o}s--RÃ©nyi random graph on $n$ vertices with edge probabi…

math.CO2025

On problems in extremal multigraph theory

Victor Falgas-Ravry, Adva Mond, Rik Sarkar +1

A multigraph G is said to be an (s,q)-graph if every s-set of vertices in G supports at most q edges (counting multiplicities). In this paper we consider the maximal sum and produc…

math.PR2025

Connectivity for square percolation and coarse cubical rigidity in random right-angled Coxeter groups

Jason Behrstock, R. Altar Ciceksiz, Victor Falgas-Ravry

We consider random right-angled Coxeter groups, $W_{I^} $ , whose presentation graph $I^$ is taken to be an ErdÅs--RÃ©nyi random graph, i.e., $I^ \sim G_{n, p}$ . We use techni…

math.CO2024

A note on locating-dominating sets in twin-free graphs

Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry +2

In this short note, we prove that every twin-free graph on $n$ vertices contains a locating-dominating set of size at most $⌈ \frac{5}{8} n ⌉$ . This improves the earlier bou…