3 citations · 7 across the 18 of their papers we have counts for
6 papers · 1 filter
On oriented cycles in randomly perturbed digraphs
Igor Araujo, József Balogh, Robert A. Krueger +2
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every , there exists a constant such…
The codegree Turán density of tight cycles minus one edge
Simón Piga, Marcelo Sales, Bjarne Schülke
Given and an integer , we prove that every sufficiently large -uniform hypergraph on vertices in which every two vertices are contained in at least …
Cycle decompositions in -uniform hypergraphs
Allan Lo, Simón Piga, Nicolás Sanhueza-Matamala
We show that -uniform hypergraphs on vertices whose codegree is at least can be decomposed into tight cycles, subject to the trivial divisibility conditions.…
Ramsey numbers with prescribed rate of growth
Matías Pavez-Signé, Simón Piga, Nicolás Sanhueza-Matamala
Let be the two-colour Ramsey number of a graph . In this note, we prove that for any non-decreasing function , there exists a sequence of connect…
The induced saturation problem for posets
Andrea Freschi, Simón Piga, Maryam Sharifzadeh +1
For a fixed poset , a family of subsets of is induced -saturated if does not contain an induced copy of , but for every subset of …
Turán density of cliques of order five in -uniform hypergraphs with quasirandom links
Sören Berger, Simón Piga, Christian Reiher +2
We show that -uniform hypergraphs with the property that all vertices have a quasirandom link graph with density bigger than contain a clique on five vertices. This result…