Simón Piga
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Simón Piga has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Andrew Treglown
University of Birmingham
8 shared publications - Igor Araujo
University of Illinois at Urbana-Champaign
4 shared publications - Nicolás Sanhueza-Matamala
Supported London School of Economics Houghton Street WC2A 2AE London United Kingdom
4 shared publications - Andrea Freschi
School of Mathematics, University of Birmingham, U.K.
3 shared publications - Bjarne Schülke
Institute for Basic Science
3 shared publications - Maryam Sharifzadeh
Umeå Universitet
3 shared publications
Latest Publications
- Open Access
- 27 March 2026
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 58 (4)
Hypergraphs with arbitrarily small codegree Turán density
The codegree Turán density of a ‐graph is the smallest such that every ‐graph with contains a copy of . In this work, we show that for every , there is a ‐uniform hypergraph with . The initial preprint of this work leads to significant subsequent research on accumulation points of variants of the Turán density.
- 27 March 2026
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 58 (4)
Open AccessHypergraphs with arbitrarily small codegree Turán density
The codegree Turán density of a ‐graph is the smallest such that every ‐graph with contains a copy of . In this work, we show that for every , there is a ‐uniform hypergraph with . The initial preprint of this work leads to significant subsequent research on accumulation points of variants of the Turán density.
- Open Access
- 7 August 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 176, 1-6
The codegree Turán density of 3-uniform tight cycles
- 7 August 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 176, 1-6
Open AccessThe codegree Turán density of 3-uniform tight cycles
- Open Access
Turán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links
We show that $3$-uniform hypergraphs with the property that all vertices have a quasirandom link graph with density bigger than $1/3$ contain a clique on five vertices. This result is asymptotically best possible.Open AccessTurán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links
We show that $3$-uniform hypergraphs with the property that all vertices have a quasirandom link graph with density bigger than $1/3$ contain a clique on five vertices. This result is asymptotically best possible. - Open Access
Cycle decompositions in $k$-uniform hypergraphs
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 AccessCycle decompositions in $k$-uniform hypergraphs
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
- 5 March 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 167, 55-103
Cycle decompositions in k-uniform hypergraphs
- 5 March 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 167, 55-103
Open AccessCycle decompositions in k-uniform hypergraphs
- Open Access
- 22 December 2023
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 3 (3)
The induced saturation problem for posets
For a fixed poset \(P\), a family \(\mathcal F\) of subsets of \([n]\) is induced \(P\)-saturated if \(\mathcal F\) does not contain an induced copy of \(P\), but for every subset \(S\) of \([n]\) such that \( S\not \in \mathcal F\), \(P\) is an induced subposet of \(\mathcal F \cup \{S\}\). The size of the smallest such family \(\mathcal F\) is denoted by \(\text{sat}^* (n,P)\). Keszegh, Lemons, Martin, Pálvölgyi and Patkós [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset \(P\), either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P)\geq \log _2 n\). In this paper we improve this general result showing that either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P) \geq \min\{ 2 \sqrt{n}, n/2+1\}\). Our proof makes use of a Turán-type result for digraphs.Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset \(\Diamond\) we have \(\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})\); so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, Pálvölgyi and Patkós states that given any poset \(P\), either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P)\geq n+1\). We prove that this latter conjecture is true for a certain class of posets \(P\).Mathematics Subject Classifications: 06A07, 05D05Keywords: Partially ordered sets, saturation, Turán-type problems- 22 December 2023
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 3 (3)
Open AccessThe induced saturation problem for posets
For a fixed poset \(P\), a family \(\mathcal F\) of subsets of \([n]\) is induced \(P\)-saturated if \(\mathcal F\) does not contain an induced copy of \(P\), but for every subset \(S\) of \([n]\) such that \( S\not \in \mathcal F\), \(P\) is an induced subposet of \(\mathcal F \cup \{S\}\). The size of the smallest such family \(\mathcal F\) is denoted by \(\text{sat}^* (n,P)\). Keszegh, Lemons, Martin, Pálvölgyi and Patkós [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset \(P\), either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P)\geq \log _2 n\). In this paper we improve this general result showing that either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P) \geq \min\{ 2 \sqrt{n}, n/2+1\}\). Our proof makes use of a Turán-type result for digraphs.Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset \(\Diamond\) we have \(\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})\); so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, Pálvölgyi and Patkós states that given any poset \(P\), either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P)\geq n+1\). We prove that this latter conjecture is true for a certain class of posets \(P\).Mathematics Subject Classifications: 06A07, 05D05Keywords: Partially ordered sets, saturation, Turán-type problems - Open Access
The induced saturation problem for posets
For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, $P$ is an induced subposet of $\mathcal F \cup \{S\}$. The size of the smallest such family $\mathcal F$ is denoted by $\text{sat}^* (n,P)$. Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq \log _2 n$. In this paper we improve this general result showing that either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P) \geq \min\{ 2 \sqrt{n}, n/2+1\}$. Our proof makes use of a Tur\'an-type result for digraphs. Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset $\Diamond$ we have $\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})$; so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os states that given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq n+1$. We prove that this latter conjecture is true for a certain class of posets $P$.Open AccessThe induced saturation problem for posets
For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, $P$ is an induced subposet of $\mathcal F \cup \{S\}$. The size of the smallest such family $\mathcal F$ is denoted by $\text{sat}^* (n,P)$. Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq \log _2 n$. In this paper we improve this general result showing that either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P) \geq \min\{ 2 \sqrt{n}, n/2+1\}$. Our proof makes use of a Tur\'an-type result for digraphs. Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset $\Diamond$ we have $\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})$; so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os states that given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq n+1$. We prove that this latter conjecture is true for a certain class of posets $P$. - Open Access
- 8 November 2023
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 33 (2) , 157-178
On oriented cycles in randomly perturbed digraphs
- 8 November 2023
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 33 (2) , 157-178
Open AccessOn oriented cycles in randomly perturbed digraphs
- Open Access
Tiling edge-ordered graphs with monotone paths and other structures
Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$ has a long history, culminating in the Kühn--Osthus theorem [Combinatorica 2009] which resolves this problem, up to an additive constant, for all graphs $F$. In this paper we initiate the study of the analogous question for edge-ordered graphs. In particular, we characterize for which edge-ordered graphs $F$ this problem is well-defined. We also apply the absorbing method to asymptotically determine the minimum degree threshold for forcing a perfect $P$-tiling in an edge-ordered graph, where $P$ is any fixed monotone path.Open AccessTiling edge-ordered graphs with monotone paths and other structures
Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$ has a long history, culminating in the Kühn--Osthus theorem [Combinatorica 2009] which resolves this problem, up to an additive constant, for all graphs $F$. In this paper we initiate the study of the analogous question for edge-ordered graphs. In particular, we characterize for which edge-ordered graphs $F$ this problem is well-defined. We also apply the absorbing method to asymptotically determine the minimum degree threshold for forcing a perfect $P$-tiling in an edge-ordered graph, where $P$ is any fixed monotone path. - Open Access
On oriented cycles in randomly perturbed digraphs
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum semi-degree at least $\alpha n$, if one adds $Cn$ random edges then asymptotically almost surely the resulting digraph contains a consistently oriented Hamilton cycle. We generalize their result, showing that the hypothesis of this theorem actually asymptotically almost surely ensures the existence of every orientation of a cycle of every possible length, simultaneously. Moreover, we prove that we can relax the minimum semi-degree condition to a minimum total degree condition when considering orientations of a cycle that do not contain a large number of vertices of indegree $1$. Our proofs make use of a variant of an absorbing method of Montgomery.Open AccessOn oriented cycles in randomly perturbed digraphs
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum semi-degree at least $\alpha n$, if one adds $Cn$ random edges then asymptotically almost surely the resulting digraph contains a consistently oriented Hamilton cycle. We generalize their result, showing that the hypothesis of this theorem actually asymptotically almost surely ensures the existence of every orientation of a cycle of every possible length, simultaneously. Moreover, we prove that we can relax the minimum semi-degree condition to a minimum total degree condition when considering orientations of a cycle that do not contain a large number of vertices of indegree $1$. Our proofs make use of a variant of an absorbing method of Montgomery.