edited by
1,568 views
0 votes
0 votes
How many transitive relations are there on a set with n elements if

(a) n = 1

(b) n = 2

(c) n= 3

Answer has not been given. How do I calculate number of transitive relations?

For n = 1, there will be 1 transitive relation.

For n = 2, If $(a,b) \varepsilon R$ and $(b,a)\varepsilon R$ the $(a,a)\varepsilon R$ and $(b,b)\varepsilon R$. But how can we calculate this?
edited by

3 Answers

Best answer
2 votes
2 votes


 

(a) take only self loops (not necessarily all at a time). 4 options.

(b) There are two interconnecting lines.for Transitive relation select any edge (but not both). For each line case (a) occurs. So 2*2= 8

(c) select all self loops all interconnecting edges i.e. whole relation. 1 relation.

selected by
2 votes
2 votes

for n=2, there is one more easy method. Just count total number of relations for n=2 which is 22x2 = 16. Now remove those which are not transitive.

eg: if A={1,2} then, relations which will not be transitive will be - {(1,2),(2,1)}, {(1,2),(2,1),(1,1)},{(1,2),(2,1),(2,2)} which are 3. So total number of Transitive relations will be 16-3 = 13.

Related questions

4 votes
4 votes
1 answer
1
ram_18051996 asked Jul 7, 2017
2,578 views
Is (S, R) a poset if S is the set of all people in the world and (a, b) ∈ R, where a and b are people,if a is not taller than b?