Register

Recent questions tagged partial-order

0 votes
0 answers
61
Kenneth Rosen Ex 7.6
User Avatar
0 votes
0 answers
62
Self Doubt
Is the dual of TOSET, a TOSET always?
Is the dual of TOSET, a TOSET always?
User Avatar
2 votes
2 answers
63
Set Relation
Answer please explain the ans. R is antisymmetric then aRb, bRa -> a=b so a-b=0 and 0 is not odd positive then how it is antisymmetric?
Answer please explain the ans.R is antisymmetric then aRb, bRa - a=b so a-b=0 and 0 is not odd positive then how it is antisymmetric?
User Avatar
4 votes
1 answer
64
Relation and Partial order
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?
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?
User Avatar
7 votes
1 answer
65
Test by Bikram | Mock GATE | Test 3 | Question: 20
The maximum length of cycles in a digraph of partial order on $G$ having $p$ elements is _______: $p$ $p^{-1}$ $1$ $2^{p}$
The maximum length of cycles in a digraph of partial order on $G$ having $p$ elements is _______: $p$ $p^{-1}$ $1$ $2^{p}$
User Avatar
0 votes
2 answers
67
UGC NET CSE | December 2010 | Part 2 | Question: 3
A partially ordered set is said to be a lattice if every two elements in the set have A unique least upper bound A unique greatest lower bound Both $(A)$ and $(B)$ None of the above
A partially ordered set is said to be a lattice if every two elements in the set haveA unique least upper boundA unique greatest lower boundBoth $(A)$ and $(B)$None of th...
User Avatar
0 votes
1 answer
68
GATE Overflow | Mathematics | Test 1 | Question: 5
Let $X = \{2,3,6,12,24\}$ and $£$ be the partial order defined by $X £ Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X,£)$ is? 3 4 9 None of the above
Let $X = \{2,3,6,12,24\}$ and $£$ be the partial order defined by $X £ Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X,&po...
User Avatar
22 votes
5 answers
79
GATE CSE 1996 | Question: 1.2
Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is $3$ $4$ $9$ None of the above
Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is$3$$4$$9$No...
User Avatar
19 votes
3 answers
86
GATE CSE 1991 | Question: 01,xiv
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
User Avatar
Page: