Quasi-random graphs
- 1 December 1989
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 9 (4) , 345-362
- https://doi.org/10.1007/bf02125347
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- On universality of graphs with uniformly distributed edgesDiscrete Mathematics, 1986
- Intersection Theorems for Vector SpacesEuropean Journal of Combinatorics, 1985
- Intersection theorems with geometric consequencesCombinatorica, 1981
- The eigenvalues of random symmetric matricesCombinatorica, 1981
- Graphs which Contain all Small GraphsEuropean Journal of Combinatorics, 1981
- Cyclotomy and difference families in elementary abelian groupsJournal of Number Theory, 1972
- A Constructive Solution to a Tournament ProblemCanadian Mathematical Bulletin, 1971
- On Character Sums and Primitive Roots†Proceedings of the London Mathematical Society, 1962