activity
20192024
most citedTotal Cut Complexes of Graphs

6 citations · 9 across the 5 of their papers we have counts for

collaborators

7 papers

math.CO2024

Matching Complexes of Outerplanar Graphs

Margaret Bayer, Marija Jelić Milutinović, Julianne Vega

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are…

math.CO2024

Topology of Cut Complexes II

Margaret Bayer, Mark Denker, Marija Jelić Milutinović +2

We continue the study of the -cut complex of a graph initiated in the paper of Bayer, Denker, Jelić Milutinović, Rowlands, Sundaram and Xue [Topology of cut complex…

math.CO2023★ 3 cited

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…

math.CO2022

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…

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.CO2021

The tripartite-circle crossing number of graphs with two small partition classes

Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović +4

A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not…