KOSZULNESS OF VERTEX COVER ALGEBRAS OF BIPARTITE GRAPHS

被引：0
|
作者：
Rinaldo, Giancarlo [1 ]
机构：
[1] Univ Messina, Dipartimento Matemat, I-98166 Messina, Italy
来源：
COMMUNICATIONS IN ALGEBRA | 2011年 / 39卷 / 07期
关键词：
Cohen-Macaulay; Edge ideal; Fiber cone; Koszul; Vertex cover;
D O I：
10.1080/00927870903286884
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G be a bipartite graph and let (A) over bar (G) be the fiber cone of the Alexander dual of the edge ideal. We show that when (A) over bar (G) is a domain then (A) over bar (G) is Koszul. We also give new characterizations of unmixed and Cohen-Macaulay bipartite graphs.
引用
收藏
页码：2249 / 2259
页数：11
相关论文
共 50 条
  • [1] ON THE HILBERT SERIES OF VERTEX COVER ALGEBRAS OF UNMIXED BIPARTITE GRAPHS
    Ion, Cristian
    [J]. MATHEMATICAL REPORTS, 2011, 13 (04): : 337 - 346
  • [2] ON THE HILBERT SERIES OF VERTEX COVER ALGEBRAS OF COHEN-MACAULAY BIPARTITE GRAPHS
    Ion, Cristian
    [J]. MATEMATICHE, 2010, 65 (01): : 89 - 99
  • [3] Blowup algebras of ideals of vertex covers of bipartite graphs
    Gitler, I
    Reyes, E
    Villarreal, RH
    [J]. Algebraic Structures and Their Representations, 2005, 376 : 273 - 279
  • [4] On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
    Vahan Mkrtchyan
    Garik Petrosyan
    K. Subramani
    Piotr Wojciechowski
    [J]. Theory of Computing Systems, 2024, 68 : 122 - 143
  • [5] On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
    Mkrtchyan, Vahan
    Petrosyan, Garik
    Subramani, K.
    Wojciechowski, Piotr
    [J]. THEORY OF COMPUTING SYSTEMS, 2024, 68 (01) : 122 - 143
  • [6] PARTIAL VERTEX COVER AND BUDGETED MAXIMUM COVERAGE IN BIPARTITE GRAPHS
    Caskurlu, Bugra
    Mkrtchyan, Vahan
    Parekh, Ojas
    Subramani, K.
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (03) : 2172 - 2184
  • [7] The k-path vertex cover in Cartesian product graphs and complete bipartite graphs
    Li, Zhao
    Zuo, Liancui
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2018, 331 : 69 - 79
  • [8] Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
    Chen, H
    Kanj, IA
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (04) : 833 - 847
  • [9] Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs
    Jena, Sangram K.
    Subramani, K.
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 103 - 115
  • [10] A new efficient algorithm for weighted vertex cover in bipartite graphs based on a dual problem
    Zhang Yujiao
    Duan Xia
    Yue Xuerong
    Chen Zhibin
    [J]. 2018 NINTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY IN MEDICINE AND EDUCATION (ITME 2018), 2018, : 20 - 23
12345