7 papers
The threshold for the asymmetric vertex-Ramsey property in randomly perturbed graphs
Asier Calbet, Victor Falgas-Ravry, Joseph Hyde
For and graphs , we say that is vertex-Ramsey, or -Ramsey, if whenever we colour the vertices of …
The maximum number of triangles in -free graphs
Asier Calbet, Ritesh Goenka
We consider the following generalized Turán problem: For , what is the maximum number of triangles in a -free graph on vertices? The previously best k…
Twin-free -saturated Graphs and Maximally Independent Sets in -free Graphs
Asier Calbet
We say that two vertices are twins if they have the same neighbourhood and that a graph is -saturated if it does not contain but adding any new edge to it creates a $K_r…
The asymptotic behaviour of
Asier Calbet, Andrea Freschi
For a family of graphs, is the minimum number of edges in a graph on vertices which does not contain any of the graphs in b…
A collection of open problems in celebration of Imre Leader's 60th birthday
Rahil Baber, Natalie Behague, Asier Calbet +10
One of the great pleasures of working with Imre Leader is to experience his infectious delight on encountering a compelling combinatorial problem. This collection of open problems…
-saturated Graphs and the Two Families Theorem
Asier Calbet
Given a graph , we say that a graph is -saturated if contains no copy of but adding any new edge to creates a copy of . Let be the minimum n…
The Number of Locally -stable Functions on
Asier Calbet
A Boolean function on the vertex set of a graph is locally -stable if for every vertex the proportion of neighbours of with …