Matías Pavez-Signé

According to our database, Matías Pavez-Signé authored at least 11 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Dirac-type conditions for spanning bounded-degree hypertrees.

Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Maya Stein

J. Comb. Theory B, March, 2024

Spanning subdivisions in Dirac graphs.

Matías Pavez-Signé

Comb. Probab. Comput., January, 2024

Counting spanning subgraphs in dense hypergraphs.

Richard Montgomery, Matías Pavez-Signé

Comb. Probab. Comput., 2024

2023

Ramsey goodness of trees in random graphs.

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

Random Struct. Algorithms, July, 2023

Ramsey Numbers with Prescribed Rate of Growth.

Matías Pavez-Signé, Simón Piga, Nicolás Sanhueza-Matamala

Electron. J. Comb., 2023

2021

Quasi-random words and limits of word sequences.

Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé

Eur. J. Comb., 2021

Universal arrays.

Matías Pavez-Signé, Daniel A. Quiroz, Nicolás Sanhueza-Matamala

Discret. Math., 2021

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

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

Comb. Probab. Comput., 2021

2020

Maximum and Minimum Degree Conditions for Embedding Trees.

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

SIAM J. Discret. Math., 2020

2019

Degree Conditions for Embedding Trees.

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

SIAM J. Discret. Math., 2019

Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces.

Mario Bravo, Roberto Cominetti, Matías Pavez-Signé

Math. Program., 2019