Simón Piga

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

3 citations · 5 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2021★ 2 cited

Cycle decompositions in $3$ -uniform hypergraphs

Simón Piga, Nicolás Sanhueza-Matamala

We show that $3$ -graphs on $n$ vertices whose codegree is at least $(2/3 + o (1)) n$ can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divis…

math.CO2020

$r$ -cross $t$ -intersecting families via necessary intersection points

Pranshu Gupta, Yannick Mogge, Simón Piga +1

Given integers $r \geq 2$ and $n, t \geq 1$ we call families $F_{1}, \dots, F_{r} \subseteq P ([n])$ $r$ -cross $t$ -intersecting if for all $F_{i} \in F_{i}$ ,…

math.CO2020

On extremal problems concerning the traces of sets

Simón Piga, Bjarne Schülke

Given two non-negative integers $n$ and $s$ , define $m (n, s)$ to be the maximal number such that in every hypergraph $H$ on $n$ vertices and with at most $m (n, s)$ edges t…

math.CO2020★ 3 cited

Localised codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs

Pedro Araújo, Simón Piga, Mathias Schacht

We study sufficient conditions for the existence of Hamilton cycles in uniformly dense $3$ -uniform hypergraphs. Problems of this type were first considered by Lenz, Mubayi, and Myc…

Cycle decompositions in 3-uniform hypergraphs

r-cross t-intersecting families via necessary intersection points

On extremal problems concerning the traces of sets

Localised codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs

Cycle decompositions in $3$ -uniform hypergraphs

$r$ -cross $t$ -intersecting families via necessary intersection points