Unmixed graphs that are domains

Bruno Benedetti, Matteo Varbaro

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

We extend a theorem of Villareal on bipartite graphs to the class of all graphs. On the way to this result, we study the basic covers algebra Ā(G) of an arbitrary graph G. We characterize with purely combinatorial methods the cases when 1) Ā(G) is a domain and 2) G is unmixed and Ā(G) is a domain.

Original languageEnglish (US)
Pages (from-to)2260-2267
Number of pages8
JournalCommunications in Algebra
Volume39
Issue number7
DOIs
StatePublished - Jul 1 2011
Externally publishedYes

Keywords

  • Basic covers
  • Minimal vertex covers
  • Symbolic powers
  • Unmixed graphs

ASJC Scopus subject areas

  • Algebra and Number Theory

Fingerprint Dive into the research topics of 'Unmixed graphs that are domains'. Together they form a unique fingerprint.

  • Cite this