Representations of Indifference Relations |
Common terms and phrases
adjacency matrix adjacent algorithm Appendix axioms betwixt binary relation Chapter compatible simple order complete partite graphs connected graph consecutive 1's countable cycle define definition denote dim H dim S(n embedding equivalence relation equivalent points finite graph finite indifference system fixed variance follows function f G₁ G₂ Goodman system graph A,I graph G implies independent normal family irreflexive Lekkerkerker lemma matrix n-space non-adjacent extreme points notion of indifference oriented graph pairwise point of G primitive 4-cycle proof of theorem proper interval graph prove Q.E.D. Corollary real interval graph real line real-valued function representable by jnds result rigid-cycle satisfies Scott and Suppes semiorder strict partial order strongly representable structure theorem Suppose A,P Suppose G symmetric complement symmetric graph theorem 2.4 triple point weak components weak extreme point weak indifference system weak order weakly connected subgraph weakly representable whence