Abstract
G(n) denotes a graph of n vertices and Ḡ(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let Ck(G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k1where the minimum is over all graphs G(n).
Publisher
Canadian Mathematical Society
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Blowup Ramsey numbers;European Journal of Combinatorics;2021-02
2. On Multiplicity of Quadrilaterals in Complete Graphs;Indian Journal of Pure and Applied Mathematics;2019-03
3. Maximum Size of Reverse-Free Sets of Permutations;SIAM Journal on Discrete Mathematics;2013-01
4. On a conjecture of Erdős for multiplicities of cliques;Journal of Discrete Algorithms;2012-12
5. Randomness friendly graphs;Random Structures & Algorithms;1996-05