Simón Piga

activity

20202026

most citedLocalised codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs

3 citations · 7 across the 18 of their papers we have counts for

collaborators

18 papers

math.CO2026

Upper bounds on the running time of bootstrap percolation

Weichan Liu, Xiangxiang Nie, Simón Piga +1

For $k$ -graphs $F$ and $H_{0}$ the $F$ -bootstrap percolation process (or $F$ -process) starting with $H_{0}$ is a sequence $(H_{i})_{i \geq 0}$ of $k$ -graphs such that $H_{i + 1}$ is obtained…

math.CO2026

Hamiltonicity of inhomogeneous random graphs

Frederik Garbe, Jan Hladký, Simón Piga

We provide a complete characterization of those graphons $W$ for which the inhomogeneous random graph $\G(n,W)$ is asymptotically almost surely Hamiltonian. The characterization…

math.CO2025

On possible uniform Turán densities

Dylan King, Simón Piga, Marcelo Sales +1

Given a family of $3$ -graphs $F$ , the uniform Turán density $π_{∴} (F)$ is defined as the infimum $d \in [0, 1]$ for which any sufficiently large uniformly…

math.CO2024

Powers of Hamilton cycles in oriented and directed graphs

Louis DeBiasio, Jie Han, Allan Lo +3

The Pósa--Seymour conjecture determines the minimum degree threshold for forcing the $k$ th power of a Hamilton cycle in a graph. After numerous partial results, Komlós, Sárközy and…

math.CO2024

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

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

Given any $ε > 0$ we prove that every sufficiently large $n$ -vertex $3$ -graph $H$ where every pair of vertices is contained in at least $(1/3 + ε) n$ edges contains…

math.CO2023

Simplicial Turán problems

David Conlon, Simón Piga, Bjarne Schülke

A simplicial complex $H$ consists of a pair of sets $(V, E)$ where $V$ is a set of vertices and $E \subseteq P (V)$ is a collection of subsets of $V$ closed under taking subs…