For every positive integern we show the construction of a strongly regular graph of order at most 2n+2 which contains every graph of ordern as a subgraph. The estimation concerning the construction is best possible.
Mathematics Subject Classification (1991)05 C 35
Unable to display preview. Download preview PDF.
- L. Babai, andP. Frankl: Linear algebraic methods in combinatorics (Preliminary version).Google Scholar
- B. Bollobás, andA. Thomason: Graph which contains all small graphs,Europ. J. Combinatorics, (1981),2, 13–15.Google Scholar
- N. Alon, J. Spencer, andP. Erdős:The probabilistic method, Wiley Interscience Publication, 1992.Google Scholar
- A. E. Brouwer, A. M. Cohen, andA. Neumaier:Distance-regular graphs, Springer Verlag, Berlin, 1989.Google Scholar