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.

References Powered by Scopus

Distributive lattices, bipartite graphs and Alexander duality

124Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity

63Citations
N/AReaders
Get full text

Existence of unimodular triangulations-positive results

8Citations
N/AReaders
Get full text

Resolution of unmixed bipartite graphs

7Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers over time

‘09‘11‘12‘14‘15‘16‘1700.511.52

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 5

56%

Professor / Associate Prof. 2

22%

Lecturer / Post doc 2

22%

Readers' Discipline

Tooltip

Mathematics 8

89%

Agricultural and Biological Sciences 1

11%

Save time finding and organizing research with Mendeley

Sign up for free
0