Is there currently an algorithm that given the number of vertices / nodes `n`

, and the number of edges per node `l`

, output all graph edges?

If not, is there an algorithm that can tell if such graph is possible?

In both cases, this is an undirected, loop-free graph.

agraph with such properties? Just any graph. Thanks! $\endgroup$ – DaKnOb Jun 29 '17 at 10:21`l`

, but`n`

must be restricted to (multiples of)`2^l`

. Thanks a lot of the help. Let's wait and see. $\endgroup$ – DaKnOb Jun 29 '17 at 10:36