NSNicolás Sanhueza-Matamala

Nicolás Sanhueza-Matamala

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Nicolás Sanhueza-Matamala has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

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

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

    Given any $\varepsilon>0$ we prove that every sufficiently large $n$-vertex $3$-graph $H$ where every pair of vertices is contained in at least $(1/3+\varepsilon)n$ edges contains a copy of $C_{10}$, i.e.\ the tight cycle on $10$ vertices. In fact we obtain the same conclusion for every cycle $C_\ell$ with $\ell\geq 19$.

  • Open Access

    Cycle decompositions in $k$-uniform hypergraphs

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

    We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler tours as well. In passing, we also investigate decompositions into tight paths. In addition, we also prove an alternative condition for building absorbers for edge-decompositions of arbitrary $k$-uniform hypergraphs, which should be of independent interest.

  • Open Access

    Cycle decompositions in k-uniform hypergraphs

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

  • Open Access

    Ramsey numbers with prescribed rate of growth

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

    Let $R(G)$ be the two-colour Ramsey number of a graph $G$. In this note, we prove that for any non-decreasing function $n \leq f(n) \leq R(K_n)$, there exists a sequence of connected graphs $(G_n)_{n\in\mathbb N}$, with $|V(G_n)| = n$ for all $n \geq 1$, such that $R(G_n) = \Theta(f(n))$. In contrast, we also show that an analogous statement does not hold for hypergraphs of uniformity at least $5$. We also use our techniques to answer a question posed by DeBiasio about the existence of sequences of graphs whose $2$-colour Ramsey number is linear whereas their $3$-colour Ramsey number has superlinear growth.

  • Open Access

    On sufficient conditions for spanning structures in dense graphs

    by Richard Lang, Nicolás Sanhueza-Matamala

    We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and, excluding the bipartite case, contains an odd cycle. A simple consequence of the Robust Expander Theorem of K\"uhn, Osthus and Treglown tells us that any large enough graph that robustly satisfies these properties must already be Hamiltonian. Our main result generalises this phenomenon to powers of cycles and graphs of sublinear bandwidth subject to natural generalisations of connectivity, matchings and odd cycles. This answers a question of Ebsen, Maesaka, Reiher, Schacht and Sch\"ulke and solves the embedding problem that underlies multiple lines of research on sufficient conditions for spanning structures in dense graphs. As applications, we recover and establish Bandwidth Theorems in a variety of settings including Ore-type degree conditions, P\'osa-type degree conditions, deficiency-type conditions, locally dense and inseparable graphs, multipartite graphs as well as robust expanders.

  • Open Access

    Dirac-type conditions for spanning bounded-degree hypertrees

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

    We prove that for fixed $k$, every $k$-uniform hypergraph on $n$ vertices and of minimum codegree at least $n/2+o(n)$ contains every spanning tight $k$-tree of bounded vertex degree as a sub\-graph. This generalises a well-known result of Koml\'os, S\'ark\"ozy and Szemer\'edi for graphs. Our result is asymptotically sharp. We also prove an extension of our result to hypergraphs that satisfy some weak quasirandomness conditions.

  • Cycle Decompositions in 3-Uniform Hypergraphs

    by Simón Piga, Nicolás Sanhueza-Matamala


  • Open Access

    Minimum degree conditions for tight Hamilton cycles

    by Richard Lang, Nicolás Sanhueza-Matamala

    We develop a new framework to study minimum $d$-degree conditions in $k$-uniform hypergraphs, which guarantee the existence of a tight Hamilton cycle. Our main theoretical result deals with the typical absorption, path cover and connecting arguments for all $k$ and $d$ at once, and thus sheds light on the underlying structural problems. Building on this, we show that one can study minimum $d$-degree conditions of $k$-uniform tight Hamilton cycles by focusing on the inner structure of the neighbourhoods. This reduces the matter to an Erd\H{o}s--Gallai-type question for $(k-d)$-uniform hypergraphs, which is of independent interest. Once this framework is established, we can easily derive two new bounds. Firstly, we extend a classic result of R\"odl, Ruci\'nski and Szemer\'edi for $d=k-1$ by determining asymptotically best possible degree conditions for $d = k-2$ and all $k \ge 3$. This was proved independently by Polcyn, Reiher, R\"odl and Sch\"ulke. Secondly, we provide a general upper bound of $1-1/(2(k-d))$ for the tight Hamilton cycle $d$-degree threshold in $k$-uniform hypergraphs, thus narrowing the gap to the lower bound of $1-1/\sqrt{k-d}$ due to Han and Zhao.

  • Open Access

    Longest paths in random hypergraphs

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

    Given integers $k,j$ with $1\le j \le k-1$, we consider the length of the longest $j$-tight path in the binomial random $k$-uniform hypergraph $H^k(n,p)$. We show that this length undergoes a phase transition from logarithmic length to linear and determine the critical threshold, as well as proving upper and lower bounds on the length in the subcritical and supercritical ranges. In particular, for the supercritical case we introduce the `Pathfinder' algorithm, a depth-first search algorithm which discovers $j$-tight paths in a $k$-uniform hypergraph. We prove that, in the supercritical case, with high probability this algorithm will find a long $j$-tight path.

  • Covering and tiling hypergraphs with tight cycles

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

    A k-uniform tight cycle $C_s^k$ is a hypergraph on s > k vertices with a cyclic ordering such that every k consecutive vertices under this ordering form an edge. The pair (k, s) is admissible if gcd (k, s) = 1 or k / gcd (k,s) is even. We prove that if $s \ge 2{k^2}$ and H is a k-uniform hypergraph with minimum codegree at least (1/2 + o(1))|V(H)|, then every vertex is covered by a copy of $C_s^k$ . The bound is asymptotically sharp if (k, s) is admissible. Our main tool allows us to arbitrarily rearrange the order in which a tight path wraps around a complete k-partite k-uniform hypergraph, which may be of independent interest.For hypergraphs F and H, a perfect F-tiling in H is a spanning collection of vertex-disjoint copies of F. For $k \ge 3$ , there are currently only a handful of known F-tiling results when F is k-uniform but not k-partite. If s ≢ 0 mod k, then $C_s^k$ is not k-partite. Here we prove an F-tiling result for a family of non-k-partite k-uniform hypergraphs F. Namely, for $s \ge 5{k^2}$ , every k-uniform hypergraph H with minimum codegree at least (1/2 + 1/(2s) + o(1))|V(H)| has a perfect $C_s^k$ -tiling. Moreover, the bound is asymptotically sharp if k is even and (k, s) is admissible.