Connectedness of certain graph coloring complexes

被引：0
|
作者：
Nilakantan, Nandini [1 ]
Shukla, Samir [2 ]
机构：
[1] Indian Inst Technol IIT Kanpur, Kanpur, India
[2] Indian Inst Technol IIT Mandi, Mandi, India
来源：
TOPOLOGY AND ITS APPLICATIONS | 2024年 / 354卷
关键词：
Neighborhood complex; Hom complex; Exponential graph; Discrete Morse theory; DISCRETE MORSE-THEORY; CONJECTURE; TOPOLOGY; LOVASZ; PROOF;
D O I：
10.1016/j.topol.2024.108985
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this article, we consider the bipartite graphs K-2 x K-n . We prove that the connectedness of the complex Hom(K-2 x K-n, K-m) is m - n - 1 if m >= n and m -3 in all the other cases. Therefore, we show that for this class of graphs, Hom(G, K-m) is exactly (m - d - 2)-connected, m >= n, where d is the maximal degree of the graph G . (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页数：26
相关论文
共 50 条
  • [21] Graph coloring and conditional graph entropy
    Doshi, Vishal
    Shah, Devavrat
    Medard, Muriel
    Jaggi, Sidharth
    2006 FORTIETH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-5, 2006, : 2137 - +
  • [22] Graph Coloring on the GPU
    Osama, Muhammad
    Minh Truong
    Yang, Carl
    Buluc, Aydin
    Owens, John D.
    2019 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2019, : 231 - 240
  • [23] ROLE COLORING A GRAPH
    EVERETT, MG
    BORGATTI, S
    MATHEMATICAL SOCIAL SCIENCES, 1991, 21 (02) : 183 - 188
  • [24] Graph coloring with rejection
    Epstein, Leah
    Levin, Asaf
    Woeginger, Gerhard J.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2011, 77 (02) : 439 - 447
  • [25] Strategic Coloring of a Graph
    Escoffier, Bruno
    Gourves, Laurent
    Monnot, Jerome
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2010, 6078 : 155 - 166
  • [26] Dynamic Graph Coloring
    Luis Barba
    Jean Cardinal
    Matias Korman
    Stefan Langerman
    André van Renssen
    Marcel Roeloffzen
    Sander Verdonschot
    Algorithmica, 2019, 81 : 1319 - 1341
  • [27] The Center Coloring of a Graph
    Yorgancioglu, Zeynep Ors
    Dundar, Pinar
    Berberler, Murat Ersen
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2015, 18 (05): : 531 - 540
  • [28] Dynamic Graph Coloring
    Barba, Luis
    Cardinal, Jean
    Korman, Matias
    Langerman, Stefan
    van Renssen, Andre
    Roeloffzen, Marcel
    Verdonschot, Sander
    ALGORITHMICA, 2019, 81 (04) : 1319 - 1341
  • [29] Applications of graph coloring
    Ufuktepe, Ü
    Bacak, G
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, PT 3, 2005, 3482 : 522 - 528
  • [30] On the graph coloring polytope
    Palubeckis, Gintaras
    INFORMATION TECHNOLOGY AND CONTROL, 2008, 37 (01): : 7 - 11
12345