Degree-diameter problem N(20,4)N(20,4)

The largest possible number of vertices in a graph of maximum degree 2020 and diameter 44.

Lower bound: 3495234952 (34,952)
Upper bound: Unknown

Updates