A weighted graph problem from commutative algebra
Commutative Algebra
2011-06-09 v3 Combinatorics
Abstract
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
Cite
@article{arxiv.0704.3696,
title = {A weighted graph problem from commutative algebra},
author = {Peter M. Johnson},
journal= {arXiv preprint arXiv:0704.3696},
year = {2011}
}