Unmixed bipartite graphs
arXiv:math/0606479
Abstract
In this note we give a combinatorial characterization of all the unmixed bipartite graphs.
To appear in Rev. Colombiana Mat
Cited by in corpus (10)
- Boij-Söderberg theory: Introduction and survey
- Edge ideals: algebraic and combinatorial properties
- Unmixed bipartite graphs and sublattices of the Boolean lattices
- Resolution of Unmixed Bipartite Graphs
- Unmixed d-uniform r-partite hypergraphs
- Syzygies, Betti numbers and regularity of cover ideals of certain multipartite graphs
- Unmixed Graphs that are Domains
- Systems with the integer rounding property in normal monomial subrings
- Non-vanishing of Betti numbers of edge ideals and complete bipartite subgraphs
- On the (parameterized) complexity of recognizing well-covered (r,l)-graphs