Matías Pavez-Signé

activity

20182025

most citedMaximum and minimum degree conditions for embedding trees

2 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2025

Separating edges by linearly many subdivisions

George Kontogeorgiou, Matias Pavez-Signe, Maya Stein +2

We prove that for any two graphs $G$ and $H$ , the edges of $G$ can be strongly separated by a collection of linearly many subdivisions of $H$ and single edges. This confirms a conj…

math.CO2020

Ramsey goodness of trees in random graphs

Pedro Araújo, Luiz Moreira, Matías Pavez-Signé

For a graph $G$ , we write $G \to (K_{r + 1}, T (n, D))$ if every blue-red colouring of the edges of $G$ contains either a blue copy of $K_{r + 1}$ , or a red copy…

math.CO2019

On the Erdős-Sós conjecture for trees with bounded degree

Guido Besomi, Matías Pavez-Signé, Maya Stein

We prove the Erd\H os--Sós conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number o…

math.CO2018★ 2 cited

Maximum and minimum degree conditions for embedding trees

Guido Besomi, Matías Pavez-Signé, Maya Stein

We propose the following conjecture: For every fixed $α \in [0, \frac{1}{3})$ , each graph of minimum degree at least $(1 + α) \frac{k}{2}$ and maximum degree at least $2 (1 - α) k$ contains each…

math.CO2018

Degree conditions for embedding trees

Guido Besomi, Matías Pavez-Signé, Maya Stein

We conjecture that every $n$ -vertex graph of minimum degree at least $\frac{k}{2}$ and maximum degree at least $2 k$ contains all trees with $k$ edges as subgraphs. We prove an approxi…