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.