Skip to main content
SpringerLink
Log in

A strongly regularN-full graph of small order

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Babai, andP. Frankl: Linear algebraic methods in combinatorics (Preliminary version).

  2. B. Bollobás, andA. Thomason: Graph which contains all small graphs,Europ. J. Combinatorics, (1981),2, 13–15.

    Google Scholar 

  3. N. Alon, J. Spencer, andP. Erdős:The probabilistic method, Wiley Interscience Publication, 1992.

  4. A. E. Brouwer, A. M. Cohen, andA. Neumaier:Distance-regular graphs, Springer Verlag, Berlin, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Yale University, 06520, New Haven, CT, USA

    Van H. Vu

Authors
  1. Van H. Vu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vu, V.H. A strongly regularN-full graph of small order. Combinatorica 16, 295–299 (1996). https://doi.org/10.1007/BF01844853

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01844853

Mathematics Subject Classification (1991)

Search

Navigation