Nicolás Sanhueza-Matamala

According to our database, Nicolás Sanhueza-Matamala authored at least 19 papers between 2016 and 2026.

Collaborative distances:

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

2026

Separating path systems in trees.

Francisco Arrepol, Patricio Asenjo, Raúl Astete, Victor Cartes, Anahí Gajardo, Valeria Henríquez, Catalina Opazo, Nicolás Sanhueza-Matamala, Christopher Thraves Caro

J. Optim. Theory Appl., February, 2026

The codegree Turán density of 3-uniform tight cycles.

Simón Piga, Nicolás Sanhueza-Matamala, Mathias Schacht

J. Comb. Theory B, 2026

Optimal and Efficient Partite Decompositions of Hypergraphs.

Andrew Krapivin, Benjamin Przybocki, Nicolás Sanhueza-Matamala, Bernardo Subercaseaux

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

Ramsey numbers of cycles in random graphs.

Pedro Araújo, Matías Pavez-Signé, Nicolás Sanhueza-Matamala

Random Struct. Algorithms, January, 2025

Color-Bias Perfect Matchings in Hypergraphs.

Hiêp Hàn, Richard Lang, João Pedro Marciano, Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Andrew Treglown, Camila Zárate-Guerén

SIAM J. Discret. Math., 2025

Vertex-separating path systems in trees.

Milene Gutiérrez, Nicolás Sanhueza-Matamala, Christopher Thraves Caro

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

Partitioning problems in concave-round digraphs and tournaments.

Constanza Gacitúa Fuentes, Nikolas Jara Cádiz, Pablo Opazo Salazar, Nicolás Sanhueza-Matamala, Christopher Thraves Caro

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

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

Cycle decompositions in k-uniform hypergraphs.

Allan Lo, Simón Piga, Nicolás Sanhueza-Matamala

J. Comb. Theory B, 2024

Separating Path Systems in Complete Graphs.

Cristina G. Fernandes, Guilherme Oliveira Mota, Nicolás Sanhueza-Matamala

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Cycle Decompositions in 3-Uniform Hypergraphs.

Simón Piga, Nicolás Sanhueza-Matamala

Comb., February, 2023

Ramsey Numbers with Prescribed Rate of Growth.

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

Electron. J. Comb., 2023

2021

Longest Paths in Random Hypergraphs.

Oliver Cooley, Frederik Garbe, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala, Julian Zalla

SIAM J. Discret. Math., 2021

Universal arrays.

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

Discret. Math., 2021

Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs.

Simón Piga, Nicolás Sanhueza-Matamala

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2019

An asymptotic bound for the strong chromatic number.

Allan Lo, Nicolás Sanhueza-Matamala

Comb. Probab. Comput., 2019

2018

Density of Monochromatic Infinite Paths.

Allan Lo, Nicolás Sanhueza-Matamala, Guanghui Wang

Electron. J. Comb., 2018

2017

Covering and tiling hypergraphs with tight cycles.

Jie Han, Allan Lo, Nicolás Sanhueza-Matamala

Electron. Notes Discret. Math., 2017

2016

Stability and Ramsey numbers for cycles and wheels.

Nicolás Sanhueza-Matamala

Discret. Math., 2016