New upper bounds on the order of cages

Electronic Journal of Combinatorics

Volumn 4, Issue 2 R, 1997, Pages 1-11

  Lazebnik, F ^a   Ustimenko, V A ^b   Woldar, A J ^c  

^a UNIVERSITY OF DELAWARE   (United States)

^b TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

^c VILLANOVA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038410788     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. N. Alon, Tools from Higher Algebra, in: Handbook of Combinatorics, Volume II (edit. R. L. Graham, M. Grötschel, L. Lovász), MIT Press, North-Holland, New York, 1995.
2. N. L. Biggs, Algebraic Graph Theory (2nd ed.), Cambridge University Press, 1993.
3. N. L. Biggs and A. G. Boshier, Note on the girth of Ramanujan graphs, Journal of Combinatorial Theory Series B, vol. 49 , 190-194 (1990).
4. B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.
5. B. Bollobás, Random Graphs, Academic Press, London, 1985.
6. A. E. Brouwer, A. M. Cohen, A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Heidelberg - New York, 1989.
7. P. Erdos and H. Sachs, Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Univ. Halle Martin Luther Univ. Halle-Wittenberg Math.-Natur.Reine 12 (1963), 251-257.
8. D. A. Holton, J. Sheehan, The Petersen Graph, Australian Mathematical Society, Lecture Notes 7, Cambridge University Press, 1993.
9. Z. Füredi, F. Lazebnik, Á. Seress, V. A. Ustimenko, A. J. Woldar, Graphs of prescribed girth and bi-degree, Journal of Combinatorial Theory Ser. B 64 (2) (1995), 228-239.
10. F. Lazebnik, V. A. Ustimenko, Explicit construction of graphs with arbitrary large girth and of large size, Discrete Applied Mathematics 60 (1995), 275-284.
11. F. Lazebnik, V. A. Ustimenko, A. J. Woldar, New constructions of bipartite graphs on m,n vertices, with many edges, and without small cycles, Journal of Combinatorial Theory Sci. B 61 (1) (1994), 111-117.
12. F. Lazebnik, V. A. Ustimenko, A. J. Woldar, A new series of dense graphs of high girth, Bulletin of the AMS 32 (1) (1995), 73-79.
13. F. Lazebnik, V. A. Ustimenko, A. J. Woldar, A characterization of the components of the graphs D(k,q), Discrete Mathematics 157 (1996) 271-283.
14. L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
15. A. Lubotzky, R. Phillips, R. Sarnak, Ramanujan graphs, Combinatorica 8 (3) (1988), 261-277.
16. G. A. Margulis, Explicit group-theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators, Journal of Problems of Information Transmission (1988), 39-46.
17. H. L. Montgomery, Topics in Multiplicative Number Theory, Lecture Notes in Mathematics 227, Springer Verlag, New York, 1971.
18. G. Royle, Cubic cages, http://www.ss.uwa.edu.au/gordon/cages/index.html.
19. H. Sachs, Regular graphs with given girth and restricted circuits, J. London Math. Society 38 (1963), 423-429.
20. N. Sauer, Extremaleigenschaften regulärer Graphen gegebener Taillenweite, I and II, Sitzungsberichte Österreich. Acad. Wiss. Math. Natur. K1., S-B II, 176 (1967), 9-25; 176 (1967), 27-43.
21. N. Sauer, Extremaleigenschaften regulärer Graphen gegebener Taillenweite, I and II, Sitzungsberichte Österreich. Acad. Wiss. Math. Natur. K1., S-B II, 176 (1967), 9-25; 176 (1967), 27-43.
22. H. Walther, Eigenschaften von regulären Graphen gegebener Taillenweite und minimaler Knotenzahl, Wiss. Z. Ilmenau 11 (1965), 167-168.
23. H. Walther, Über reguläre Graphen gegebener Taillenweite und minimaler Knotenzahl, Wiss. Z. Techn. Hochsch. Ilmenau 11 (1965), 93-96.
24. P.-K. Wong, Cages - A Survey, Journal of Graph Theory Vol. 6 (1982), 1-22.