Matías Pavez-Signé

From MaRDI portal
Person:1979438



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Monochromatic partitions in 2-edge-coloured bipartite graphs
The Electronic Journal of Combinatorics
2026-02-04Paper
Counting spanning subgraphs in dense hypergraphs
Combinatorics, Probability and Computing
2025-12-16Paper
Color-bias perfect matchings in hypergraphs
SIAM Journal on Discrete Mathematics
2025-10-10Paper
Ramsey numbers of bounded degree trees versus general graphs
Journal of Combinatorial Theory. Series B
2025-05-07Paper
Towards a hypergraph version of the Pósa-Seymour conjecture
Advances in Combinatorics
2025-04-29Paper
Spanning trees in pseudorandom graphs via sorting networks
Proceedings of the American Mathematical Society
2025-04-15Paper
Ramsey numbers of cycles in random graphs
Random Structures & Algorithms
2025-02-14Paper
Spanning subdivisions in Dirac graphs
Combinatorics, Probability and Computing
2024-11-05Paper
Embedding trees with maximum and minimum degree conditions
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Ramsey numbers with prescribed rate of growth
The Electronic Journal of Combinatorics
2024-02-23Paper
Dirac-type conditions for spanning bounded-degree hypertrees
Journal of Combinatorial Theory. Series B
2024-01-15Paper
Spanning trees in pseudorandom graphs via sorting networks2023-11-06Paper
Ramsey numbers of bounded degree trees versus general graphs2023-10-31Paper
Ramsey goodness of trees in random graphs
Random Structures & Algorithms
2023-10-23Paper
Counting spanning subgraphs in dense hypergraphs2023-08-14Paper
Spanning trees in the square of pseudorandom graphs2023-07-01Paper
Spanning subdivisions in Dirac graphs2023-06-06Paper
On the Erdős–Sós conjecture for trees with bounded degree
Combinatorics, Probability and Computing
2023-03-30Paper
Quasi-random words and limits of word sequences
LATIN 2020: Theoretical Informatics
2022-10-13Paper
Ramsey numbers of cycles in random graphs2022-08-27Paper
Towards a hypergraph version of the P\'osa-Seymour conjecture2021-10-18Paper
Universal arrays
Discrete Mathematics
2021-09-30Paper
Quasi-random words and limits of word sequences
European Journal of Combinatorics
2021-09-02Paper
Maximum and minimum degree conditions for embedding trees
SIAM Journal on Discrete Mathematics
2020-10-27Paper
Degree conditions for embedding trees
SIAM Journal on Discrete Mathematics
2019-09-02Paper
On the Erd\H{o}s-S\'os conjecture for trees with bounded degree
(available as arXiv preprint)
2019-06-24Paper
Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces
Mathematical Programming. Series A. Series B
2019-05-17Paper
Monochromatic partitions in 2-edge-coloured bipartite graphs
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Matías Pavez-Signé