Hot questions in Discrete Mathematics

60 votes
10 answers
2
How many perfect matching are there in a complete graph of $6$ vertices?$15$$24$$30$$60$
113 votes
9 answers
3
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
13 votes
3 answers
4
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$
39 votes
9 answers
7
102 votes
11 answers
8
33 votes
14 answers
10
Let $G$ be an undirected complete graph on $n$ vertices, where $n 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to$n!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
57 votes
17 answers
13
19 votes
18 answers
16
33 votes
9 answers
17
55 votes
6 answers
18
52 votes
15 answers
19