Asier Calbet

activity

20242026

collaborators

3 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.CO2025

The maximum number of triangles in $K_{1, s, t}$ -free graphs

Asier Calbet, Ritesh Goenka

We consider the following generalized TurÃ¡n problem: For $2 \leq s \leq t$ , what is the maximum number of triangles in a $K_{1, s, t}$ -free graph on $n$ vertices? The previously best…

math.CO2024

Twin-free $K_{r}$ -saturated Graphs and Maximally Independent Sets in $K_{3}$ -free Graphs

Asier Calbet

We say that two vertices are twins if they have the same neighbourhood and that a graph is $K_{r}$ -saturated if it does not contain $K_{r}$ but adding any new edge to it creates a $K_r…

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

The maximum number of triangles in K1,s,t​-free graphs

Twin-free Kr​-saturated Graphs and Maximally Independent Sets in K3​-free Graphs

The maximum number of triangles in $K_{1, s, t}$ -free graphs

Twin-free $K_{r}$ -saturated Graphs and Maximally Independent Sets in $K_{3}$ -free Graphs