- Combinatorics 1 (26.62 KiB) Viewed 116 times
Combinatorics
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Combinatorics
Combinatorics
5. (a) For n € N, find the number of 1-regular graphs G with V(G) = {1,2,..., 2n}. Show that it is equal to 2-" (2n)². (b) For n € N, find the number of 2-regular graphs G with V(G) = {1,2,..., 3n} such that every cycle in G has length 3. Show that it is equal to 6-(3n)²n
5. (a) For n € N, find the number of 1-regular graphs G with V(G) = {1,2,..., 2n}. Show that it is equal to 2-" (2n)². (b) For n € N, find the number of 2-regular graphs G with V(G) = {1,2,..., 3n} such that every cycle in G has length 3. Show that it is equal to 6-(3n)²n