6 citations · 9 across the 7 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.CO2022★ 6 cited
Total Cut Complexes of Graphs
Margaret Bayer, Mark Denker, Marija Jelić Milutinović +3
Inspired by work of Fröberg (1990), and Eagon and Reiner (1998), we define the \emph{total -cut complex} of a graph to be the simplicial complex whose facets are the complem…
math.CO2022
A Lower Bound Theorem for strongly regular CW spheres with up to vertices
Lei Xue
In 1967, Grünmbaum conjectured that any -dimensional polytope with vertices has at least \[ϕ_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \]…