Geodesic
On Subgraphs of the Complete Bipartite Graph
Canadian mathematical bulletin, Tome 7 (1964) no. 1, pp. 35-39

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

DOI

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 k 1 where the minimum is over all graphs G(n). 
Erdös, P.; Moon, J. W. On Subgraphs of the Complete Bipartite Graph. Canadian mathematical bulletin, Tome 7 (1964) no. 1, pp. 35-39. doi: 10.4153/CMB-1964-003-8
@article{10_4153_CMB_1964_003_8,
     author = {Erd\"os, P. and Moon, J. W.},
     title = {On {Subgraphs} of the {Complete} {Bipartite} {Graph}},
     journal = {Canadian mathematical bulletin},
     pages = {35--39},
     year = {1964},
     volume = {7},
     number = {1},
     doi = {10.4153/CMB-1964-003-8},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-003-8/}
}
TY  - JOUR
AU  - Erdös, P.
AU  - Moon, J. W.
TI  - On Subgraphs of the Complete Bipartite Graph
JO  - Canadian mathematical bulletin
PY  - 1964
SP  - 35
EP  - 39
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-003-8/
DO  - 10.4153/CMB-1964-003-8
ID  - 10_4153_CMB_1964_003_8
ER  - 
%0 Journal Article
%A Erdös, P.
%A Moon, J. W.
%T On Subgraphs of the Complete Bipartite Graph
%J Canadian mathematical bulletin
%D 1964
%P 35-39
%V 7
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-003-8/
%R 10.4153/CMB-1964-003-8
%F 10_4153_CMB_1964_003_8

Cité par Sources :