88 citations · 227 across the 22 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013
Face numbers of down-sets
Michal Adamaszek
We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced met…
math.CO2013★ 2 cited
An upper bound theorem for a class of flag weak pseudomanifolds
Michal Adamaszek
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal numbe…
math.CO2013
The smallest nonevasive graph property
Michal Adamaszek
A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form "is there an edge between vertices u and v" requires, in th…