New lower bound on the Shannon capacity of C7 from circular graphs

被引：0
|
作者：
Polak, Sven C. [1 ]
Schrijver, Alexander [1 ]
机构：
[1] Korteweg–De Vries Institute for Mathematics, University of Amsterdam, Netherlands
来源：
Information Processing Letters | 2019年 / 143卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
下载
收藏
页码：37 / 40
相关论文
共 50 条
  • [21] C7 POLYMORPHISM IN JAPANESE - NEW ALLELE C7-STAR-8
    KOMATSU, N
    KIDO, A
    OYA, M
    JAPANESE JOURNAL OF HUMAN GENETICS, 1988, 33 (02): : 278 - 278
  • [22] A NEW LOWER BOUND ON THE NUMBER OF PERFECT MATCHINGS IN CUBIC GRAPHS
    Kral', Daniel
    Sereni, Jean-Sebastien
    Stiebitz, Michael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (03) : 1465 - 1483
  • [23] A New Lower Bound for the Eternal Vertex Cover Number of Graphs
    Babu, Jasine
    Prabhakaran, Veena
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 27 - 39
  • [24] A new lower bound for the eternal vertex cover number of graphs
    Jasine Babu
    Veena Prabhakaran
    Journal of Combinatorial Optimization, 2022, 44 : 2482 - 2498
  • [25] A new lower bound for the eternal vertex cover number of graphs
    Babu, Jasine
    Prabhakaran, Veena
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (04) : 2482 - 2498
  • [26] A NEW LOWER BOUND FOR THE NUMBER OF ROOTS OF MAPS BETWEEN GRAPHS
    Zhao, Xuezhi
    TOPOLOGICAL METHODS IN NONLINEAR ANALYSIS, 2009, 33 (01) : 17 - 29
  • [27] New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs
    Heping Zhang
    Fuji Zhang
    Journal of Mathematical Chemistry, 2001, 30 : 343 - 347
  • [28] New lower bound on the number of perfect matchings in fullerene graphs
    Zhang, HP
    Zhang, FJ
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2001, 30 (03) : 343 - 347
  • [29] Lower bound on the shannon capacity of MIMO space-time communications systems based on the leakage level
    Chambers, Pat
    Downing, Conor
    Baher, Hussein
    2007 LOUGHBOROUGH ANTENNAS AND PROPAGATION CONFERENCE, PROCEEDINGS, 2007,
  • [30] LOWER BOUND FOR INDEPENDENCE COVERING IN C4-FREE GRAPHS
    Kuhn, Michael
    Lokshtanov, Daniel
    Miller, Zachary
    arXiv, 2023,
12345