MPMatías Pavez-Signé
Matías Pavez-Signé
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Matías Pavez-Signé has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Nicolás Sanhueza-Matamala
Supported London School of Economics Houghton Street WC2A 2AE London United Kingdom
2 shared publications - Maya Stein
University of Chile
1 shared publication - Simón Piga
University of Birmingham, United Kingdom
1 shared publication
Latest Publications
- 20 October 2023
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 33 (1) , 121-128
Spanning subdivisions in Dirac graphs
We show that for every -regular graph.
- 20 October 2023
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 33 (1) , 121-128
Spanning subdivisions in Dirac graphs
We show that for every -regular graph.
- Open Access
Ramsey numbers with prescribed rate of growth
Let $R(G)$ be the two-colour Ramsey number of a graph $G$. In this note, we prove that for any non-decreasing function $n \leq f(n) \leq R(K_n)$, there exists a sequence of connected graphs $(G_n)_{n\in\mathbb N}$, with $|V(G_n)| = n$ for all $n \geq 1$, such that $R(G_n) = \Theta(f(n))$. In contrast, we also show that an analogous statement does not hold for hypergraphs of uniformity at least $5$. We also use our techniques to answer a question posed by DeBiasio about the existence of sequences of graphs whose $2$-colour Ramsey number is linear whereas their $3$-colour Ramsey number has superlinear growth.Open AccessRamsey numbers with prescribed rate of growth
Let $R(G)$ be the two-colour Ramsey number of a graph $G$. In this note, we prove that for any non-decreasing function $n \leq f(n) \leq R(K_n)$, there exists a sequence of connected graphs $(G_n)_{n\in\mathbb N}$, with $|V(G_n)| = n$ for all $n \geq 1$, such that $R(G_n) = \Theta(f(n))$. In contrast, we also show that an analogous statement does not hold for hypergraphs of uniformity at least $5$. We also use our techniques to answer a question posed by DeBiasio about the existence of sequences of graphs whose $2$-colour Ramsey number is linear whereas their $3$-colour Ramsey number has superlinear growth. - Open Access
Spanning subdivisions in Dirac graphs
We show that for every $n\in\mathbb N$ and $\log n\le d\le n$, if a graph $G$ has $N=Θ(dn)$ vertices and minimum degree $(1+o(1))\frac{N}{2}$, then it contains a spanning subdivision of every $n$-vertex $d$-regular graph.Open AccessSpanning subdivisions in Dirac graphs
We show that for every $n\in\mathbb N$ and $\log n\le d\le n$, if a graph $G$ has $N=Θ(dn)$ vertices and minimum degree $(1+o(1))\frac{N}{2}$, then it contains a spanning subdivision of every $n$-vertex $d$-regular graph. - Open Access
Dirac-type conditions for spanning bounded-degree hypertrees
We prove that for fixed $k$, every $k$-uniform hypergraph on $n$ vertices and of minimum codegree at least $n/2+o(n)$ contains every spanning tight $k$-tree of bounded vertex degree as a sub\-graph. This generalises a well-known result of Koml\'os, S\'ark\"ozy and Szemer\'edi for graphs. Our result is asymptotically sharp. We also prove an extension of our result to hypergraphs that satisfy some weak quasirandomness conditions.Open AccessDirac-type conditions for spanning bounded-degree hypertrees
We prove that for fixed $k$, every $k$-uniform hypergraph on $n$ vertices and of minimum codegree at least $n/2+o(n)$ contains every spanning tight $k$-tree of bounded vertex degree as a sub\-graph. This generalises a well-known result of Koml\'os, S\'ark\"ozy and Szemer\'edi for graphs. Our result is asymptotically sharp. We also prove an extension of our result to hypergraphs that satisfy some weak quasirandomness conditions.