6 citations · 18 across the 13 of their papers we have counts for
16 papers
Topology of Cut Complexes of Graphs
Margaret Bayer, Mark Denker, Marija Jelić Milutinović +3
We define the -cut complex of a graph with vertex set to be the simplicial complex whose facets are the complements of sets of size in inducing disconnecte…
General polygonal line tilings and their matching complexes
Margaret Bayer, Marija Jelić Milutinović, Julianne Vega
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching…
Perfect Matching Complexes of Honeycomb Graphs
Margaret Bayer, Marija Jelić Milutinović, Julianne Vega
The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies…
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…
Lattice polytopes from Schur and symmetric Grothendieck polynomials
Margaret Bayer, Bennet Goeckner, Su Ji Hong +5
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope i…
Manifold Matching Complexes
Margaret Bayer, Bennet Goeckner, Marija Jelić Milutinović
The matching complex of a graph is the simplicial complex whose vertex set is the set of edges of the graph with a face for each independent set of edges. In this paper we complete…