Matías Pavez-Signé

Orcid: 0000-0001-9418-5058

According to our database1, Matías Pavez-Signé authored at least 16 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Monochromatic Partitions in 2-Edge-Coloured Bipartite Graphs.
Electron. J. Comb., 2026

2025
Ramsey numbers of cycles in random graphs.
Random Struct. Algorithms, January, 2025

Color-Bias Perfect Matchings in Hypergraphs.
SIAM J. Discret. Math., 2025

Ramsey numbers of bounded degree trees versus general graphs.
J. Comb. Theory B, 2025

Separating edges by linearly many subdivisions.
Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2024
Dirac-type conditions for spanning bounded-degree hypertrees.
J. Comb. Theory B, March, 2024

Spanning subdivisions in Dirac graphs.
Comb. Probab. Comput., January, 2024

Counting spanning subgraphs in dense hypergraphs.
Comb. Probab. Comput., 2024

2023
Ramsey goodness of trees in random graphs.
Random Struct. Algorithms, July, 2023

Ramsey Numbers with Prescribed Rate of Growth.
Electron. J. Comb., 2023

2021
Universal arrays.
Discret. Math., 2021

On the Erdős-Sós conjecture for trees with bounded degree.
Comb. Probab. Comput., 2021

2020
Maximum and Minimum Degree Conditions for Embedding Trees.
SIAM J. Discret. Math., 2020

Quasi-Random Words and Limits of Word Sequences.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Degree Conditions for Embedding Trees.
SIAM J. Discret. Math., 2019

Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces.
Math. Program., 2019


  Loading...