Bipartite graphs whose edge algebras are complete intersections
| dc.creator | Katzman, Mordechai | |
| dc.date | 2002-09-25 | |
| dc.date.accessioned | 2026-07-07T04:51:14Z | |
| dc.date.available | 2026-07-07T04:51:14Z | |
| dc.description | Let R be monomial sub-algebra of $k[x_1,...,x_N]$ generated by square free monomials of degree two. This paper addresses the following question: when is R a complete intersection? For such a k-algebra we can associate a graph G whose vertices are $x_1,...,x_N$ and whose edges are $\{(x_i, x_j) | x_i x_j \in R \}$. Conversely, for any graph G with vertices $\{x_1,...,x_N\}$ we define the {\it edge algebra associated with G} as the sub-algebra of $k[x_1,...,x_N]$ generated by the monomials ${x_i x_j | (x_i,x_j) \text{is an edge of} G}$. We denote this monomial algebra by k[G]. This paper describes all bipartite graphs whose edge algebras are complete intersections. | |
| dc.identifier | https://arxiv.org/abs/math/0209348 | |
| dc.identifier | http://arxiv.org/abs/math/0209348 | |
| dc.identifier | Journal of Algebra, 220 (1999) pp. 519-530 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65075 | |
| dc.subject | Commutative Algebra | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 14M10 14M25 05E | |
| dc.title | Bipartite graphs whose edge algebras are complete intersections | |
| dc.type | text |