Number of labeled simple graphs with n edges and n vertices such that it is not possible to choose a different vertex from each edge (non-choosable).
A369143
Number of labeled simple graphs with n edges and n vertices such that it is not possible to choose a different vertex from each edge (non-choosable).
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =30a(6) =1335a(7) =47460a(8) =1651230a(9) =59636640a(10) =2284113762a(11) =93498908580
External references
- oeis: A369143