A graph for which the inertia bound is not tight

被引：0
|
作者：
John Sinkovic
机构：
[1] University of Waterloo,Department of Combinatorics and Optimization
来源：
Journal of Algebraic Combinatorics | 2018年 / 47卷
关键词：
Inertia bound; Cvetković bound; Independence number; Weight matrix; 05C50; 05C69; 15A42;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The inertia bound gives an upper bound on the independence number of a graph by considering the inertia of matrices corresponding to the graph. The bound is known to be tight for graphs on 10 or fewer vertices as well as for all perfect graphs. It is natural to question whether the bound is always tight. We show that the bound is not tight for the Paley graph on 17 vertices as well as its induced subgraph on 16 vertices.
引用
收藏
页码：39 / 50
页数：11
相关论文
共 50 条
  • [21] A TIGHT SPACE BOUND FOR CONSENSUS
    Zhu, Leqi
    [J]. SIAM JOURNAL ON COMPUTING, 2021, 50 (03)
  • [22] Erratum to: Tight bound for matching
    Yijie Han
    [J]. Journal of Combinatorial Optimization, 2013, 26 (2) : 412 - 414
  • [23] A tight bound on negativity of superpositions
    K.-H. Ma
    C. S. Yu
    H. S. Song
    [J]. The European Physical Journal D, 2010, 59 : 317 - 320
  • [24] A Tight Space Bound for Consensus
    Zhu, Leqi
    [J]. STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 345 - 350
  • [25] A Tight Bound for Congestion of an Embedding
    Manuel, Paul
    Rajasingh, Indra
    Rajan, R. Sundara
    Parthiban, N.
    Rajalaxmi, T. M.
    [J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS (CALDAM 2015), 2015, 8959 : 229 - 237
  • [26] A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
    Malekesmaeili, Mehrnoush
    Chauve, Cedric
    Stephen, Tamon
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (20) : 799 - 803
  • [27] A tight bound on concept learning
    Takahashi, H
    Gu, HZ
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1998, 9 (06): : 1191 - 1202
  • [28] A Tight Bound of Hard Thresholding
    Shen, Jie
    Li, Ping
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2018, 18
  • [29] A TIGHT BOUND FOR HYPERAPH REGULARITY
    Moshkovitz, Guy
    Shapira, Asaf
    [J]. GEOMETRIC AND FUNCTIONAL ANALYSIS, 2019, 29 (05) : 1531 - 1578
  • [30] A Tight Bound for Hyperaph Regularity
    Guy Moshkovitz
    Asaf Shapira
    [J]. Geometric and Functional Analysis, 2019, 29 : 1531 - 1578
12345