An extremal problem for independent sets in graphs

被引：0
|
作者：
Ramamurthi, R [1 ]
机构：
[1] Univ Calif San Diego, La Jolla, CA 92093 USA
来源：
AMERICAN MATHEMATICAL MONTHLY | 2001年 / 108卷 / 08期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：773 / 774
页数：2
相关论文
共 50 条
  • [11] EXTREMAL PROBLEM FOR GRAPHS AND HYPERGRAPHS
    STERBOUL, F
    DISCRETE MATHEMATICS, 1975, 11 (01) : 71 - 78
  • [12] Independent sets in graphs
    Dainyak, Aleksandr B.
    Sapozhenko, Aleksandr A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2016, 26 (06): : 323 - 346
  • [13] Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
    Delorme, C
    Favaron, O
    Rautenbach, D
    DISCRETE APPLIED MATHEMATICS, 2003, 130 (03) : 503 - 512
  • [14] On dominating sets and independent sets of graphs
    Harant, J
    Pruchnewski, A
    Voigt, M
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
  • [15] THE SUCCESS PROBABILITY IN LEVINE'S HAT PROBLEM, AND INDEPENDENT SETS IN GRAPHS
    Alon, Noga
    Friedgut, Ehud
    Kalai, Gil
    Kindler, Guy
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (04) : 2717 - 2729
  • [16] Resolution of a Routing and Wavelength Assignment Problem by Independent Sets in Conflict Graphs
    Hudry, Olivier
    2020 7TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'20), VOL 1, 2020, : 94 - 99
  • [17] ON ONE EXTREMAL PROBLEM OF POMPEIU SETS
    Elets, L. V.
    Masharov, P. A.
    UKRAINIAN MATHEMATICAL JOURNAL, 2009, 61 (01) : 71 - 85
  • [18] EXTREMAL PROBLEM FOR 3-GRAPHS
    FRANKL, P
    ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1978, 32 (1-2): : 157 - 160
  • [19] ANOTHER EXTREMAL PROBLEM FOR TURAN GRAPHS
    HEDMAN, B
    DISCRETE MATHEMATICS, 1987, 65 (02) : 173 - 176
  • [20] Extremal graphs for the identifying code problem
    Foucaud, Florent
    Guerrini, Eleonora
    Kovse, Matjaz
    Naserasr, Reza
    Parreau, Aline
    Valicov, Petru
    EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (04) : 628 - 638
12345