VERTEX COVER ALGEBRAS OF UNIMODULAR HYPERGRAPHS

被引：0
|
作者：
Herzog, Juergen [1 ]
Hibi, Takayuki [2 ]
Ngo Viet Trung [3 ]
机构：
[1] Univ Duisburg Essen, Fachbereich Mathemat & Informat, Campus Essen, D-45117 Essen, Germany
[2] Osaka Univ, Grad Sch Informat Sci & Technol, Dept Pure & Appl Math, Osaka 5600043, Japan
[3] Inst Math, Hanoi 10307, Vietnam
来源：
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 2009年 / 137卷 / 02期
关键词：
Vertex cover algebra; unimodular hypergraph; symbolic power; monomial ideal;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
It is proved that all vertex cover algebras of a hypergraph are standard graded if and only if the hypergraph is unimodular. This has interesting consequences on the symbolic powers of monomial ideals.
引用
下载
收藏
页码：409 / 414
页数：6
相关论文
共 50 条
  • [1] Regularity of powers of cover ideals of unimodular hypergraphs
    Nguyen Thu Hang
    Tran Nam Trung
    JOURNAL OF ALGEBRA, 2018, 513 : 159 - 176
  • [2] Approximating vertex cover in dense hypergraphs
    Cardinal, Jean
    Karpinski, Marek
    Schmied, Richard
    Viehmann, Claus
    JOURNAL OF DISCRETE ALGORITHMS, 2012, 13 : 67 - 77
  • [3] On approximation of the vertex cover problem in hypergraphs
    Okun, Michael
    Discrete Optimization, 2005, 2 (01) : 101 - 111
  • [4] The behavior of depth functions of cover ideals of unimodular hypergraphs
    Nguyen Thu Hang
    Tran Nam Trung
    ARKIV FOR MATEMATIK, 2017, 55 (01): : 89 - 104
  • [5] SQUAREFREE VERTEX COVER ALGEBRAS
    Bayati, Shamila
    Rahmati, Farhad
    COMMUNICATIONS IN ALGEBRA, 2014, 42 (04) : 1518 - 1538
  • [6] An approximation algorithm for the partial vertex cover problem in hypergraphs
    El Ouali, Mourad
    Fohlin, Helena
    Srivastav, Anand
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 846 - 864
  • [7] An approximation algorithm for the partial vertex cover problem in hypergraphs
    Mourad El Ouali
    Helena Fohlin
    Anand Srivastav
    Journal of Combinatorial Optimization, 2016, 31 : 846 - 864
  • [8] Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
    Halperin, E
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 329 - 337
  • [9] Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
    Halperin, E
    SIAM JOURNAL ON COMPUTING, 2002, 31 (05) : 1608 - 1623
  • [10] Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
    Wong, Sam Chiu-wai
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2626 - 2637
12345