Sign in
Back
Unmixed Graphs that are Domains
Journal article   Peer reviewed

Unmixed Graphs that are Domains

Bruno Benedetti and Matteo Varbaro
Communications in algebra, Vol.39(7), pp.2260-2267
2011-07-01
DOI: https://doi.org/10.1080/00927872.2010.519363

Abstract

Unmixed graphs Minimal vertex covers Symbolic powers Basic covers
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 of an arbitrary graph G. We characterize with purely combinatorial methods the cases when 1) is a domain and 2) G is unmixed and is a domain.

Metrics

4 Record Views
4 Times Cited - Web of Science

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types
Domestic collaboration
International collaboration
Citation topics
9 Mathematics
9.28 Pure Maths
9.28.246 Moduli Spaces
Web Of Science research areas
Mathematics
ESI research areas
Mathematics

UN Sustainable Development Goals (SDGs)

This output has contributed to the advancement of the following goals:

undefined

Source: InCites

Details