Geodesic
On the Number of Complete Subgraphs of a Graph
Canadian mathematical bulletin, Tome 8 (1965) no. 6, pp. 831-834

Voir la notice de l'article provenant de la source Cambridge

DOI

A graph Gn consists of n nodes some pairs of which are joined by a single edge. A complete k-graph has k nodes and edges. Erdos [1] proved that if a graph Gn has edges, then it contains at least complete 3-graphs if it contains any at all. The main object of this note is to extend this result to complete k-graphs. 
Moon, J. W. On the Number of Complete Subgraphs of a Graph. Canadian mathematical bulletin, Tome 8 (1965) no. 6, pp. 831-834. doi: 10.4153/CMB-1965-065-9
@article{10_4153_CMB_1965_065_9,
     author = {Moon, J. W.},
     title = {On the {Number} of {Complete} {Subgraphs} of a {Graph}},
     journal = {Canadian mathematical bulletin},
     pages = {831--834},
     year = {1965},
     volume = {8},
     number = {6},
     doi = {10.4153/CMB-1965-065-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-065-9/}
}
TY  - JOUR
AU  - Moon, J. W.
TI  - On the Number of Complete Subgraphs of a Graph
JO  - Canadian mathematical bulletin
PY  - 1965
SP  - 831
EP  - 834
VL  - 8
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-065-9/
DO  - 10.4153/CMB-1965-065-9
ID  - 10_4153_CMB_1965_065_9
ER  - 
%0 Journal Article
%A Moon, J. W.
%T On the Number of Complete Subgraphs of a Graph
%J Canadian mathematical bulletin
%D 1965
%P 831-834
%V 8
%N 6
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-065-9/
%R 10.4153/CMB-1965-065-9
%F 10_4153_CMB_1965_065_9

Cité par Sources :