8 citations · 10 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…
Small flag complexes with torsion
Michal Adamaszek
We classify flag complexes on at most 12 vertices with torsion in the first homology group. The result is moderately computer-aided. As a consequence we confirm a folklore conjectu…
Efficient enumeration of graceful permutations
Michal Adamaszek
A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In this paper we improve the asymptotic lower bound on the number of such permutations from (5/3)^n to 2.37…