Geodesic
On Independent Complete Subgraphs in a Graph
Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 95-102

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

A graph G = G(n, e) consists of a set of n nodes e pairs of which are joined by a single edge; we assume that no edge joins a node to itself. A graph with modes is called a complete -graph if each pair of its nodes is joined by an edge. The graphs belonging to some collection of graphs are independent if no two of them have a node in common. The maximum number of independent complete -graphs contained in a given graph G will be denoted by Ik(G). 
Moon, J. W. On Independent Complete Subgraphs in a Graph. Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 95-102. doi: 10.4153/CJM-1968-012-x
@article{10_4153_CJM_1968_012_x,
     author = {Moon, J. W.},
     title = {On {Independent} {Complete} {Subgraphs} in a {Graph}},
     journal = {Canadian journal of mathematics},
     pages = {95--102},
     year = {1968},
     volume = {20},
     number = {1},
     doi = {10.4153/CJM-1968-012-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-012-x/}
}
TY  - JOUR
AU  - Moon, J. W.
TI  - On Independent Complete Subgraphs in a Graph
JO  - Canadian journal of mathematics
PY  - 1968
SP  - 95
EP  - 102
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-012-x/
DO  - 10.4153/CJM-1968-012-x
ID  - 10_4153_CJM_1968_012_x
ER  - 
%0 Journal Article
%A Moon, J. W.
%T On Independent Complete Subgraphs in a Graph
%J Canadian journal of mathematics
%D 1968
%P 95-102
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-012-x/
%R 10.4153/CJM-1968-012-x
%F 10_4153_CJM_1968_012_x

[1] 1. Erdös, P., Über ein Extremalproblem in der Graphentheorie, Arch. Math., 13 (1962), 222–227. Google Scholar

[2] 2. Erdös, P. and Gallai, T., On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar., 10 (1959), 337–356. Google Scholar

[3] 3. Erdös, P. and Pόsa, L., On the maximal number of disjoint circuits in a graph, Publ. Math. Debrecen, 9 (1962), 3–12. Google Scholar

[4] 4. Fulkerson, D. R. and Shapley, L. S., Minimal k-arc-connected graphs, The RAND Corp., P-2371 (1961), 1–11. Google Scholar

[5] 5. Turán, P., On the theory of graphs, Colloq. Math., 3 (1954), 19–30. Google Scholar

Cité par Sources :