Nicolás Sanhueza-Matamala

activity

20172026

3

-uniform hypergraphs

2 citations · 6 across the 14 of their papers we have counts for

collaborators

25 papers

math.CO2026

The asymptotic version of the Erdős-Sós conjecture and beyond

Akbar Davoodi, Diana Piguet, Hanka Řada +1

Klimošová, Piguet, and Rozhoň conjectured that any graph with minimum degree $k /2$ and sufficiently many vertices of degree $k$ should contain all trees with $k$ edges. We prove an…

math.CO2025

Loose Hamiltonicity

Richard Lang, Nicolás Sanhueza-Matamala

We study the appearance of Hamilton $ℓ$ -cycles in dense $k$ -uniform hypergraphs when $ℓ \leq k - 2$ and $k - ℓ$ does not divide $k$ . Our main result reduces this problem to th…

math.CO2025

Optimal and Efficient Partite Decompositions of Hypergraphs

Andrew Krapivin, Benjamin Przybocki, Nicolás Sanhueza-Matamala +1

We study the problem of partitioning the edges of a $d$ -uniform hypergraph $H$ into a family $F$ of complete $d$ -partite hypergraphs ( $d$ -cliques). We show that there is a partitio…

math.CO2025

Degree conditions for spanning expansion hypertrees

Mengjiao Rao, Nicolás Sanhueza-Matamala, Lin Sun +2

The $k$ -expansion of a graph $G$ is the $k$ -uniform hypergraph obtained from $G$ by adding $k - 2$ new vertices to every edge. We determine, for all $k > d \geq 1$ , asymptotically op…

math.CO2024

Blowing up Dirac's theorem

Richard Lang, Nicolás Sanhueza-Matamala

We show that every graph $G$ on $n$ vertices with $δ (G) \geq (1/2 + ε) n$ is spanned by a complete blow-up of a cycle with clusters of nearly uniform size $Ω (lo g n)$ . The p…

math.CO2024

A hypergraph bandwidth theorem

Richard Lang, Nicolás Sanhueza-Matamala

A cornerstone of extremal graph theory due to Erdős and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up o…