We describe some new applications of nonabelian pq-groups to construction problems in Graph Theory. The constructions include the smallest known trivalent graph of girth 17, the smallest known regular graphs of girth five for several degrees, along with four edge colorings of complete graphs that improve lower bounds on classical Ramsey numbers.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1217,
author = {Geoffrey Exoo},
title = {Some applications of pq-groups in graph theory},
journal = {Discussiones Mathematicae Graph Theory},
volume = {24},
year = {2004},
pages = {109-114},
zbl = {1054.05051},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1217}
}
Geoffrey Exoo. Some applications of pq-groups in graph theory. Discussiones Mathematicae Graph Theory, Tome 24 (2004) pp. 109-114. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1217/
[000] [1] G. Exoo, Some New Ramsey Colorings, Electronic J. Combinatorics 5 (1998) #R29. | Zbl 0896.05043
[001] [2] G. Exoo, A Small Trivalent Graph of Girth 14, to appear. | Zbl 0985.05040
[002] [3] M. Hall, The Theory of Groups (The Macmillan Company, New York, 1959).
[003] [4] S.P. Radziszowski, Small Ramsey Numbers, Dynamic Survey DS1, Electronic J. Combinatorics 1 (1994) pp. 28.
[004] [5] G. Royle, Cubic Cages, http://www.cs.uwa.edu.au/~gordon/cages/index.html, February, 2001 (Accessed: January 20, 2002).
[005] [6] M. Schönert et al, Groups, Algorithms and Programming, version 4 release 2, Department of Mathematics, University of Western Australia.