3 citations · 7 across the 18 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Simplicial Turán problems
David Conlon, Simón Piga, Bjarne Schülke
A simplicial complex consists of a pair of sets where is a set of vertices and is a collection of subsets of closed under taking subs…
math.CO2023★ 1 cited
Hypergraphs with arbitrarily small codegree Turán density
Simón Piga, Bjarne Schülke
Let . Given a -uniform hypergraph , the minimum codegree is the largest such that every -set of is contained in at least ed…
math.CO2023
Tiling edge-ordered graphs with monotone paths and other structures
Igor Araujo, Simón Piga, Andrew Treglown +1
Given graphs and , a perfect -tiling in is a collection of vertex-disjoint copies of in that together cover all the vertices in . The study of the minimum…