Greg Malen

most citedCollapsibility of Random Clique Complexes

1 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2019★ 1 cited

Topology and Geometry of Crystallized Polyominoes

Greg Malen, Érika Roldán

We give a complete solution to the extremal topological combinatorial problem of finding the minimum number of tiles needed to construct a polyomino with $h$ holes. We denote this…

math.CO2019★ 1 cited

Collapsibility of Random Clique Complexes

Greg Malen

We prove a sufficient condition for a finite clique complex to collapse to a $k$ -dimensional complex, and use this to exhibit thresholds for $(k + 1)$ -collapsibility in a sparse rand…

math.CO2016

Homomorphism Complexes and k-Cores

Greg Malen

We prove that the topological connectivity of a graph homomorphism complex Hom( $G, K_{m}$ ) is at least $m - D (G) - 2$ , where $D (G) = H \subseteq G max δ (H)$ . This is a strong…