Unmixed bipartite graphs and sublattices of the Boolean lattices
DOI10.1007/S10801-009-0168-1zbMATH Open1186.13020arXiv0806.1088OpenAlexW2070365165MaRDI QIDQ968230FDOQ968230
Authors: Jürgen Herzog, Takayuki Hibi, Hidefumi Ohsugi
Publication date: 5 May 2010
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.1088
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)
Cites Work
Cited In (9)
- Unmixed r-partite graphs
- Weakly polymatroidal ideals with applications to vertex cover ideals
- On the dimension of the minimal vertex cover semigroup ring of an unmixed bipartite graph
- Title not available (Why is that?)
- Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
- Existence of unimodular triangulations -- positive results
- Subgraphs of hypercubes and subdiagrams of Boolean lattices
- Koszulness of vertex cover algebras of bipartite graphs
- Freiman cover ideals of unmixed bipartite graphs
This page was built for publication: Unmixed bipartite graphs and sublattices of the Boolean lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968230)