Geodesic
On the order and the number of cliques in a random graph
Mathematica slovaca, Tome 47 (1997) no. 5, pp. 499-510
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C69, 05C80 
@article{MASLO_1997_47_5_a1,
     author = {Olej\'ar, Daniel and Toman, Eduard},
     title = {On the order and the number of cliques in a random graph},
     journal = {Mathematica slovaca},
     pages = {499--510},
     year = {1997},
     volume = {47},
     number = {5},
     mrnumber = {1635293},
     zbl = {0937.05067},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1997_47_5_a1/}
}
TY  - JOUR
AU  - Olejár, Daniel
AU  - Toman, Eduard
TI  - On the order and the number of cliques in a random graph
JO  - Mathematica slovaca
PY  - 1997
SP  - 499
EP  - 510
VL  - 47
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/MASLO_1997_47_5_a1/
LA  - en
ID  - MASLO_1997_47_5_a1
ER  - 
%0 Journal Article
%A Olejár, Daniel
%A Toman, Eduard
%T On the order and the number of cliques in a random graph
%J Mathematica slovaca
%D 1997
%P 499-510
%V 47
%N 5
%U http://geodesic.mathdoc.fr/item/MASLO_1997_47_5_a1/
%G en
%F MASLO_1997_47_5_a1
Olejár, Daniel; Toman, Eduard. On the order and the number of cliques in a random graph. Mathematica slovaca, Tome 47 (1997) no. 5, pp. 499-510. http://geodesic.mathdoc.fr/item/MASLO_1997_47_5_a1/

[1] BOLLOBÁS B.: Random Graphs. Academic Press, New York, 1985. | MR | Zbl

[2] BOLLOBÁS B.-ERDŐS P.: Cliques in random graphs. Math. Proc. Cambridge Philos. Soc. 80 (1976), 419-427. | MR | Zbl

[3] FARBER M.-HUJTER M., TUZA, ZS.: An upper bound on the number of cliques in a graph. Networks 23 (1993), 207-210. | MR | Zbl

[4] FÜREDI Z.: The number of maximal independent sets in connected graphs. J. Graph Theory 11 (1987), 463-470. | MR | Zbl

[5] HEDMAN B.: The maximum number of cliques in dense graphs. Discrete Math. 54 (1985), 161-166. | MR | Zbl

[6] KALBFLEISCH J. G.: Complete subgraphs of random hypergraphs and bipartite graphs. In: Proc. of 3rd Southeastern Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, 1972, pp. 297-304. | MR | Zbl

[7] KORSHUNOV A. D.: The basic properties of random graphs with large numbers of vertices and edges. Uspekhi Mat. Nauk 40 (1985), 107-173. (Russian) | MR

[8] MATULA D. W.: On the complete subgraphs of a random graph. In: Proc. 2nd Chapel Hill Conf. Combinatorial Math, and its Applications (R. C. Bose et al., eds.), Univ. North Carolina, Chapel Hill, 1970, pp. 356-369. | MR | Zbl

[9] MATULA D. W.: The employee party problem. Notices Amer. Math. Soc. 19 (1972), A-382.

[10] MATULA D. W.: The largest clique size in a random graph. Technical report CS 7608, Dept. of Computer Science, Southern Methodist University, Dallas, 1976.

[11] MOON J. W.-MOSER L.: On cliques in graphs. Israel J. Math. 3 (1965), 22-28. | MR | Zbl

[12] PALMER E. M.: Graphical Evolution: An Introduction to the Theory of Random Graphs. John Wiley, New York, 1985. | MR | Zbl