Let \(R = K[t_1, \ldots , t_d]\) be the polynomial ring in \(d\) indeterminates over a field \(K\). If \(G\) is a bipartite graph on the vertex set \(\{ 1, \ldots , d \}\), define \(K[G]\) to be the subalgebra of \(R\) generated by all monomials \(t_i t_j\) such that \(\{ i,j \}\) is an edge of \(G\). It is shown that if every \(n\)-cycle \((n \geq 6)\) has a chord, then \(K[G]\) is Koszul.
Recommendations
Cites work
Cited in
(49)- Markov bases for two-way subtable sum problems
- Toric ideals generalized by quadratic binomials
- Finite lattices and lexicographic Gröbner bases
- Unimodular triangulations and coverings of configurations arising from root systems
- Koszul blowup algebras associated to three-dimensional Ferrers diagrams
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Koszul multi-Rees algebras of principal \(L\)-Borel ideals
- On toric ideals arising from signed graphs
- Edge rings with \(q\)-linear resolutions
- Properties of the toric rings of a chordal bipartite family of graphs
- A survey on the Koszul homology algebra
- Primality of weakly connected collections of cells and weakly closed path polyominoes
- The structure of Koszul algebras defined by four quadrics
- Rees algebra and special fiber ring of binomial edge ideals of closed graphs
- Reflexive polytopes arising from bipartite graphs with -positivity associated to interior polynomials
- Betti numbers of Koszul algebras defined by four quadrics
- Green-Lazarsfeld condition for toric edge ideals of bipartite graphs
- Lexicographic and reverse lexicographic quadratic Gröbner bases of cut ideals
- Linearly related polyominoes
- Ideals and graphs, Gröbner bases and decision procedures in graphs
- Strongly Koszul edge rings
- Algebraic properties of the coordinate ring of a convex polyomino
- Nonsimple polyominoes and prime ideals
- Koszulness of vertex cover algebras of bipartite graphs
- A Gröbner basis characterization for chordal comparability graphs
- Existence of unimodular triangulations -- positive results
- Full Graphs and Koszul Algebras I
- Standard graded vertex cover algebras, cycles and leaves
- Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases
- Algebras arising from bipartite planar graphs
- Centrally symmetric configurations of order polytopes
- Bounds on the regularity of toric ideals of graphs
- Powers of binomial edge ideals with quadratic Gröbner bases
- Edge rings of bipartite graphs with linear resolutions
- Betti numbers of toric ideals of graphs: a case study
- Rank bounded Hibi subrings for planar distributive lattices
- Centrally symmetric configurations of integer matrices
- Markov chain Monte Carlo exact tests for incomplete two-way contingency tables
- Perfectly contractile graphs and quadratic toric rings
- Minimal generators of toric ideals of graphs
- Powers of generalized binomial edge ideals of path graphs
- Three invariants of geometrically vertex decomposable ideals
- Koszul binomial edge ideals
- On Cohen-Macaulay non-prime collections of cells
- Down-left graphs and a connection to toric ideals of graphs
- Koszul graded Möbius algebras and strongly chordal graphs
- Root polytopes, tropical types, and toric edge ideals
- Shellable flag simplicial complexes of non-simple polyominoes
- Toric ideals of graphs minimally generated by a Gröbner basis
This page was built for publication: Koszul bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277205)
