Unmixed Bipartite Graphs and Sublattices of the Boolean Lattices
نویسندگان
چکیده
The correspondence between unmixed bipartite graphs and sublattices of the Boolean lattice is discussed. By using this correspondence, we show the existence of squarefree quadratic initial ideals of toric ideals arising from minimal vertex covers of unmixed bipartite graphs.
منابع مشابه
A generalization of Villarreal's result for unmixed tripartite graphs
In this paper we give a characterization of unmixed tripartite graphs under certain conditions which is a generalization of a result of Villarreal on bipartite graphs. For bipartite graphs two different characterizations were given by Ravindra and Villarreal. We show that these two characterizations imply each other.
متن کاملUnmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملAn Axiomatization of the Lattice of Higher Relative Commutants of a Subfactor
We consider certain conditions for abstract lattices of commuting squares, that we prove are necessary and sufficient for them to arise as lattices of higher relative commutants of a subfactor. We call such lattices standard and use this axiomatization to prove that their sublattices are standard too. We consider a method for producing sublatties and deduce from this and [Po5] some criteria for...
متن کاملMaximal independent sets in bipartite graphs obtained from Boolean lattices
Attempts to enumeratemaximal antichains in Boolean lattices give rise to problems involving maximal independent sets in bipartite graphs whose vertex sets are comprised of adjacent levels of the lattice and whose edges correspond to proper containment. In this paper, we find bounds on the numbers of maximal independent sets in these graphs. © 2010 Elsevier Ltd. All rights reserved.
متن کاملOn the dimension of the minimal vertex cover semigroup ring of an unmixed bipartite graph
In a paper in 2008, Herzog, Hibi and Ohsugi introduced and studied the semigroup ring associated to the set of minimal vertex covers of an unmixed bipartite graph. In this paper we relate the dimension of this semigroup ring to the rank of the Boolean lattice associated to the graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008