Number of labeled simple graphs with n edges covering n vertices such that it is not possible to choose a different vertex from each edge (non-choosable).
A369144
Number of labeled simple graphs with n edges covering 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) =0a(6) =90a(7) =4935a(8) =200970a(9) =7636860a(10) =291089610a(11) =11459170800a(12) =471932476290
External references
- oeis: A369144