Bipartite graphs whose edge algebras are complete intersections (Q1818867): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Macaulay2 / rank | |||
Normal rank | |||
Revision as of 06:35, 28 February 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
