64 citations · 171 across the 34 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
On the probability of nonexistence in binomial subsets
Frank Mousset, Andreas Noever, Konstantinos Panagiotou +1
Given a hypergraph and a sequence of values in , let be the random subset of obtained by keeping every…
math.CO2017
Supersaturated sparse graphs and hypergraphs
Asaf Ferber, Gweneth Anne McKinley, Wojciech Samotij
A central problem in extremal graph theory is to estimate, for a given graph , the number of -free graphs on a given set of vertices. In the case when is not bipartit…
math.CO2017
Subsets of posets minimising the number of chains
Wojciech Samotij
A well-known theorem of Sperner describes the largest collections of subsets of an -element set none of which contains another set from the collection. Generalising this result,…