Unmixed bipartite graphs and sublattices of the Boolean lattices

6Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The correspondence between unmixed bipartite graphs and sublattices of the Boolean lattice is discussed. By using this correspondence, we show existence of squarefree quadratic initial ideals of toric ideals arising from minimal vertex covers of unmixed bipartite graphs. © 2009 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Herzog, J., Hibi, T., & Ohsugi, H. (2009). Unmixed bipartite graphs and sublattices of the Boolean lattices. Journal of Algebraic Combinatorics, 30(4), 415–420. https://doi.org/10.1007/s10801-009-0168-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free