11 citations · 19 across the 9 of their papers we have counts for
11 papers
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…
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…
0-Hecke modules for row-strict dual immaculate functions
Elizabeth Niese, Sheila Sundaram, Stephanie van Willigenburg +2
We introduce a new basis of quasisymmetric functions, the row-strict dual immaculate functions. We construct a cyclic, indecomposable 0-Hecke algebra module for these functions. Ou…
Row-strict dual immaculate functions
Elizabeth Niese, Sheila Sundaram, Stephanie van Willigenburg +2
We define a new basis of quasisymmetric functions, the row-strict dual immaculate functions, as the generating function of a particular set of tableaux. We establish that this defi…
Triangulations, order polytopes, and generalized snake posets
Matias von Bell, Benjamin Braun, Derek Hanely +4
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same r…
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…
2-Matching Complexes
Julianne Vega
A -matching complex is a simplicial complex which captures the relationship between -matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching T…
A positivity phenomenon in Elser's Gaussian-cluster percolation model
Galen Dorpalen-Barry, Cyrus Hettle, David C. Livingston +4
Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideratio…
Matching complexes of trees and applications of the matching tree algorithm
Marija Jelić Milutinović, Helen Jenne, Alex McDonough +1
A matching complex of a simple graph is a simplicial complex with faces given by the matchings of . The topology of matching complexes is mysterious; there are few graphs fo…
Hajós-Type Constructions and Neighborhood Complexes
Benjamin Braun, Julianne Vega
Any graph with chromatic number can be constructed by iteratively performing certain graph operations on a sequence of graphs starting with , resulting in a variety of…