13 problems
Consider the constructed families of undirected circulant graphs of dimension , with degrees and , whose orders are largest known and are given by quintic polynomials d…
Maximum-order conjecture. All these mixed graphs have the maximum possible order among mixed graphs with the same specified parameters.
Defect-2 nonexistence conjecture. There are no -graphs with and .
Cyclic Cayley graph optimality conjecture. These graphs are optimal Abelian Cayley graphs of the specified type for every , not only for .
Three-generator optimality conjecture. The graphs given by that theorem are the largest undirected Cayley graphs of Abelian groups on three generators for each diameter .
Three-generator Abelian Cayley graph conjecture. The constructed graph is as large as possible among undirected Cayley graphs of Abelian groups on three generators with diameter…
Let a -digraph be a -geodetic digraph with minimum out-degree and order … where … Thus a -digraph has excess two. The conjecture on excess two dig…
Let a -geodetic digraph be a directed graph in which, for every ordered pair of vertices, there is at most one walk of length at most . If its minimum out-degree is , its…
Let be the order of an extremal Abelian Cayley graph of degree and diameter , and let be the order of an extremal circulant graph of degree and diame…
For an Abelian Cayley graph of degree and diameter , let . The conjectured coefficient relationships are known from comparisons of extremal and largest…
For an Abelian Cayley graph of degree and diameter , let . The order bounds and the known extremal and largest-known circulant families are compared th…
Abelian Cayley graph bound. For and ,
Let be an even degree, let , and let be the diameter. Write the order of an extremal graph as a function of and . Leading-term conjecture. For any even degree…