On the decomposition of graphs into cliques

被引:0
|
作者
Bachelis, GF [1 ]
Barcume, T [1 ]
Su, XY [1 ]
机构
[1] Wayne State Univ, Dept Math, Detroit, MI 48202 USA
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show by an elementary argument that, given any greedy clique decomposition of a graph G with n vertices, the sum of the orders of the cliques is less than 5/8n(2). This gives support to a conjecture of Peter Winkler.
引用
收藏
页码:129 / 131
页数:3
相关论文
共 50 条
  • [21] On maximal cliques of polar graphs
    Cossidente, Antonio
    Marino, Giuseppe
    Pavese, Francesco
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2017, 47 : 276 - 285
  • [22] Extremal cliques in Steinhaus graphs
    Lim, Daekeun
    [J]. DISCRETE MATHEMATICS, 2010, 310 (13-14) : 1912 - 1917
  • [23] On atomic cliques in temporal graphs
    Yajun Lu
    Zhuqi Miao
    Parisa Sahraeian
    Balabhaskar Balasundaram
    [J]. Optimization Letters, 2023, 17 : 813 - 828
  • [24] DOMINATING CLIQUES IN CHORDAL GRAPHS
    KRATSCH, D
    DAMASCHKE, P
    LUBIW, A
    [J]. DISCRETE MATHEMATICS, 1994, 128 (1-3) : 269 - 275
  • [25] Balanced Subdivisions of Cliques in Graphs
    Luan, Bingyu
    Tang, Yantao
    Wang, Guanghui
    Yang, Donglei
    [J]. COMBINATORICA, 2023, 43 (05) : 885 - 907
  • [26] Coloring the maximal cliques of graphs
    Bacsó, G
    Gravier, S
    Gyárfás, A
    Preissmann, M
    Sebo, A
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2004, 17 (03) : 361 - 376
  • [27] ON THE NUMBER OF CLIQUES AND CYCLES IN GRAPHS
    Ariannejad, M.
    Emami, M.
    [J]. TRANSACTIONS ON COMBINATORICS, 2013, 2 (02) : 27 - 33
  • [28] Extremal graphs for intersecting cliques
    Chen, GT
    Gould, RJ
    Pfender, F
    Wei, B
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2003, 89 (02) : 159 - 171
  • [29] Cliques in Hyperbolic Random Graphs
    Friedrich, Tobias
    Krohmer, Anton
    [J]. 2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), 2015,
  • [30] Periphery with respect to cliques in graphs
    Santhakumaran, A. P.
    [J]. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2007, 10 (02): : 245 - 254