
doi: 10.7151/dmgt.1217
Summary: 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.
girth, Extremal problems in graph theory, Ramsey number, cage, Generalized Ramsey theory, edge coloring, degree, Cayley graph, Graphs and abstract algebra (groups, rings, fields, etc.)
girth, Extremal problems in graph theory, Ramsey number, cage, Generalized Ramsey theory, edge coloring, degree, Cayley graph, Graphs and abstract algebra (groups, rings, fields, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
