Pseudo-random graphs

North-Holland Mathematics Studies

Volumn 144, Issue C, 1987, Pages 307-331

  Thomason, Andrew ^a  

^a UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956892870     PISSN: 03040208     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0304-0208(08)73063-9     Document Type: Article

References (26)

1. thAnnual Symp. on Foundations of Computer Science, Florida, pp. 320–322.
2. Bollobás, B., Random Graphs, 1985, Academic Press.
3. Bollobás, B., Catlin, P., Topological cliques of random graphs. J. Combinatorial Theory 30 (1981), 224–227 Ser. B.
4. Bollobás, B., Catlin, P., Erdös, P., Hadwiger's conjecture is true for almost every graph. Europ. J. Combinatorics 1 (1980), 195–199.
5. Bollobás, B., Erdös, P., Cliques in random graphs. Math. Proc. Cambridge Phil. Soc. 80 (1976), 419–427.
6. Bollobás, B., Thomason, A., Graphs which contain all small graphs. Europ. J. Combinatorics 2 (1981), 13–15.
7. Bollobás, B., Thomason, A., Parallel sorting. Discrete Appl. Math. 6 (1983), 1–11.
8. Bollobás, B., Thomason, A., Random graphs of small order. Annals of Discrete Math. 28 (1985), 47–97.
9. Bollobás, B., de la Vega, W.F., The diameter of random regular graphs. Combina-torica 2 (1982), 125–134.
10. N. Calkin, personal communication.
11. Chung, F.R.K., On concentrators, superconcentrators, generaliseè and non-blocking networks. Bell System Tech. J. 58 (1978), 1765–1777.
12. Chvátal, V., Erdös, P., A note on hamiltonian circuits. Discrete Math. 2 (1972), 111–113.
13. Erdös, P., Some remarks on the theory of graphs. Bull. Amer. Math. Soc. 53 (1947), 292–294.
14. Erdös, P., On the number of complete subgraphs contained in certain graphs. Publ. Math. Inst. Hungar. Acad. Sci. VII 3 (1962), 459–464 Ser. A.
15. Erdös, P., Fajtlowicz, S., On the conjecture of Hajós. Combinatorica 1 (1981), 141–143.
16. Erdös, P., Spencer, J., Imbalances in k-colorations. Networks 1 (1972), 379–385.
17. Giraud, G., Une minoration du nombre de quadrangles unicolores et son application à la majoration des nombres Ramsey binaires-bicolores. C. R. Acad. Sci. Paris Sér. A 276 (1973), 1173–1175.
18. Y. Gurevich and S. Shelah, Expected computation time for hamiltonian path problem and clique problem (to appear.
19. Kovari, P., Sos, V.T., Turán, P., On a problem of K. Zarankiewicz. Colloq. Math. 3 (1954), 50–57.
20. Matula, D., On the complete subgraphs of a random graph. Combinatory Mathematics audits Applications, 1970, Chapel Hill, N.C., 356–369.
21. Pinch, R.G.E., Sequences well distributed in the square. Math. Proc. Cambridge Phil. Soc. 99 (1986), 19–22.
22. Seidel, J.J., A survey of two-graphs, Colloquio Internazionale sulle Teorie Combinatorie, Atti dei Convegni Lincei 17. Accad. Naz. Lincei Roma 1 (1976), 481–511.
23. Thomason, A., Hamiltonian cycles and uniquely edge colourable graphs. Annals of Discrete Math. 3 (1978), 259–268.
24. Thomason, A., An extremal function for contractions of graphs. Math. Proc. Cambridge Phil. Soc. 95 (1984), 261–265.
25. A. Thomason, Dense expanders (to appear).
26. A. Thomason, A simple linear expected time hamiltonian path algorithm (to appear).