Bipartite graphs whose edge algebras are complete intersections (Q1818867): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Toric ideals generalized by quadratic binomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normal polytopes arising from finite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the jacobian module associated to a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The integral closure of subrings associated to graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman / rank | |||
Normal rank |
Latest revision as of 11:57, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bipartite graphs whose edge algebras are complete intersections |
scientific article |
Statements
Bipartite graphs whose edge algebras are complete intersections (English)
0 references
17 April 2000
0 references
For a graph \(G\) with vertices \(x_1,\dots, x_n\) the edge algebra associated with \(G\) is defined to be the subalgebra of \(k[x_1,\dots, x_n]\) generated by the monomials \(\{x_i x_j\); \((x_i, x_j)\) is an edge of \(G\}\). This paper decsribes the bipartite graphs whose edge algebras are complete intersections.
0 references
edge algebra
0 references
bipartite graphs
0 references
complete intersections
0 references