Partially Ordered Sets
From MaRDI portal
Publication:5780132
DOI10.2307/2371374zbMath0025.31002OpenAlexW2325654786WikidataQ59509276 ScholiaQ59509276MaRDI QIDQ5780132
Publication date: 1941
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/be44f6333785f87efb011bb3c026ced8c0a90488
Related Items
Acyclic Digraphs, Young Tableaux and Nilpotent Matrices, Mathematical models of human memory, Concurrency-Preserving Minimal Process Representation, Unnamed Item, Order Types and Similarity Transformations, SZPILRAJN, ARROW AND SUZUMURA: CONCISE PROOFS OF EXTENSION THEOREMS AND AN EXTENSION, Renormings of the dual of James tree spaces, On the comparison of order types, A Partition Theorem for Triples, Changing the Depth of an Ordered Set by Decomposition, On relations of equivalence and ordering, Containment graphs and posets of paths in a tree: wheels and partial wheels, Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset, Two Double Poset Polytopes, Unnamed Item, The Hardness of Approximating Poset Dimension, A partition calculus in set theory, The Complexity of the Partial Order Dimension Problem: Closing the Gap, The chain covering number of a poset with no infinite antichains, Convex Independence in Permutation Graphs, Succinct permutation graphs, Strongly algebraically closed \(p\)-semilattices, On Modular Lattices of Order Dimension Two, Dominance drawings for DAGs with bounded modular width, Drawing Order Diagrams Through Two-Dimension Extension, Dimension is polynomial in height for posets with planar cover graphs, On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders, On the dimension of vertex labeling of k-uniform dcsl of an even cycle, Binary Relations in Mathematical Economics: On Continuity, Additivity and Monotonicity Postulates in Eilenberg, Villegas and DeGroot, Vertex Cover in Graphs with Locally Few Colors, Steiner Transitive-Closure Spanners of Low-Dimensional Posets, On homomorphisms of partially ordered sets and lattices, Metacompact subspaces of products of ordinals, On the well dimension of ordered sets, A forbidden subposet characterization of an order — dimension inequality, On the dimension of partially ordered sets, On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar, Domination graphs: Examples and counterexamples, Unnamed Item, Dimension transitiv orientierbarer graphen, AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION, Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results, A note about games-composition dimension, The Number of Plane Diagrams of a Lattice, Representation of Planar Hypergraphs by Contacts of Triangles, A note on the McKelvey uncovered set and Pareto optimality, Dimension and matchings in comparability and incomparability graphs., Decidability and ℵ0-categoricity of theories of partially ordered sets, Some cardinal characteristics of ordered sets, Set functions and Souslin’s hypothesis, Endomorphism monoids of distributive double p-algebras, On the pseudodimension of ordered sets, Compact Spaces and Spaces of Maximal Complete Subgraphs, On the lexicographic product of ordered sets, Uniqueness of means in the Cohen model, On Kierstead’s conjecture, Universal Infinite Partially Ordered Sets, Inequalities in Dimension Theory for Posets, Unnamed Item, A study of the order dimension of a poset using matrices, Crisp dimension theory and valued preference relations, Two-dimensional partial orderings: Recursive model theory, A New Perspective on the Mereotopology of RCC8., The Complexity of the Partial Order Dimension Problem, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, MEASURING THE SIZE OF INFINITE COLLECTIONS OF NATURAL NUMBERS: WAS CANTOR’S THEORY OF INFINITE NUMBER INEVITABLE?, Graph Classes and Forbidden Patterns on Three Vertices, Uniquely Restricted Matchings in Interval Graphs, Unnamed Item, General d-position sets, Measures in Boolean Algebras, The Dimension of a Comparability Graph, Partial orderings of fixed finite dimension: Model companions and density, Concerning a Certain Set of Arrangements, Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies, A note on the dimension of a poset, Partition relations for \(\kappa\)-normal ideals on \(P_{\kappa}(\lambda)\), An efficient implicit data structure for relation testing and searching in partially ordered sets, The dimension of interior levels of the Boolean lattice, 3-interval irreducible partially ordered sets, Generalized dimension of an ordered set and its MacNeille completion, The crossing number of posets, Computational aspects of the 2-dimension of partially ordered sets, A formal study of linearity axioms for fuzzy orderings, Semistandard tableaux associated with generalized labellings of posets, A conjecture on the construction of orderings by Borda's rule, Perpendicular orders, A recognition algorithm for orders of interval dimension two, Irreflexive and reflexive dimension, Perfect sequences of chain-complete posets, 2-dimension from the topological viewpoint, A half-space approach to order dimension, Simultaneous representation of interval and interval-containment orders, Simultaneous dominance representation of multiple posets, A generalized permutahedron, Representing digraphs using intervals or circular arcs, Tree-width and dimension, Dimension of fuzzy ordered sets, Dimension of CPT posets, Planar posets that are accessible from below have dimension at most 6, Interpretation of graphs in the lattices of dimension three, A quasiordering is the intersection of orderings, Conditional extensions of fuzzy preorders, Generalizations of semiorders: A review note, On a problem of Erdős and Rado, Addendum to a theorem of O. Pretzel, Efficient and non-deteriorating choice., Soft dimension theory., Searching for the dimension of valued preference relations., The computational complexity of rationalizing boundedly rational choice behavior, Maximum independent set and maximum clique algorithms for overlap graphs, Classes of perfect graphs, Timestamping messages and events in a distributed system using synchronous communication, Local dimension is unbounded for planar posets, A min-max property of chordal bipartite graphs with applications, A universal partition result for infinite homogeneous \(K_n\)-free and related graphs, Random bipartite posets and extremal problems, The dimension for the European Union Council under the Nice rules., A generalization of Moulin's Pareto extension theorem, Dimension of posets with planar cover graphs excluding two long incomparable chains, Dimension of complete simple games with minimum, The Schröder-Bernstein property for weakly minimal theories, On-line version of Rabinovitch theorem for proper intervals, The minimum cost shortest-path tree game, On polymorphism-homogeneous relational structures and their clones., Embedding linear orders in grids, Applications of Ramsey theory, A theory of recursive dimension of ordered sets, On a strong continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller, Anonymous monotonic social welfare functions, Ordered sets with interval representation and \((m,n)\)-Ferrers relation, Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces, The embeddability ordering of topological spaces, Characterizing Paretian preferences, Maximal-element rationalizability, The graph of critical pairs of a crown, Approximating the minimum clique cover and other hard problems in subtree filament graphs, On \(k\)-tree containment graphs of paths in a tree, Fractional local dimension, Computable linear orders and limitwise monotonic functions, Fuzzy preorders: conditional extensions, extensions and their representations, Extensive measurement with incomparability, On multipartite posets, The dimension of cycle-free orders, Fractional dimension of partial orders, Über eine Eigenschaft der Dedekind-MacNeilleschen Hülle, On invertibility and zero-augmentability of N-gon orders, Cardinal characteristics of the continuum and partitions, On the topology of complexes of injective words, A characteristic property of labelings and linear extensions of posets of dimension 2, Betweenness, orders and interval graphs, Dynamic choice under familiarity-based attention, Concordance graphs, Boolean layer cakes, What if utility functions do not exist?, Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n, Some counterexamples in the partition calculus, A generalization of Arrow's lemma on extending a binary relation, Split semiorders, Bipolar orientations revisited, On a geometric combinatorial problem, The fractional dimension of subsets of Boolean lattices and cartesian products, Modular decomposition and transitive orientation, Upper semicontinuous extensions of binary relations, A study of covering dimension for the class of finite lattices., A chain complete poset with no infinite antichain has a finite core, On the Dedekind-MacNeille closure of an ordered set and a theorem of Novák, Spherical containment and the Minkowski dimension of partial orders, Interval dimension and MacNeille completion, The dimension of orthomodular posets constructed by pasting Boolean algebras, Posets with large dimension and relatively few critical pairs, Standard examples as subposets of posets., On the continuous analogue of the Szpilrajn theorem. I, Functions with distant fibers and uniform continuity, Decomposing weighted digraphs into sums of chains, A characterization of the \(n\)-agent Pareto dominance relation, On some complexity properties of N-free posets and posets with bounded decomposition diameter, On the separation of two relations by a biorder or a semiorder, Forcing posets with large dimension to contain large standard examples, A note on Dilworth's theorem in the infinite case, N-free posets as generalizations of series-parallel posets, Analysis of multiple partially ordered responses to belief items with don't know option, Chains, antichains, and fibres, On finding the bidimension of a relation, Continuously representable Paretian quasi-orders, Angle orders, regular n-gon orders and the crossing number, Ranking functions and axioms for linear orders, Some results on similarities in \({\mathbb{R}}^ n\), Covering posets, Edge subdivision and dimension, Minors and dimension, Interval orders and circle orders, On circle containment orders, Mixed models, random utilities, and the triangle inequality, Algorithmic aspects of intersection graphs and representation hypergraphs, A counterexample in the theory of random orders, Planar graphs and poset dimension, Asymptotic enumeration of two-dimensional posets, The hardness of approximating the boxicity, cubicity and threshold dimension of a graph, The complexity of embedding orders into small products of chains, On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller, Partially ordered knapsack and applications to scheduling, Bounds on the \(k\)-dimension of products of special posets, The rank of a distributive lattice, Steiner transitive-closure spanners of low-dimensional posets, Permutation bigraphs and interval containments, Sur les extensions linéaires d'une famille particuliere d'ordres partiels, The proof of the removable pair conjecture for fractional dimension., On a product dimension of graphs, Complexity of dimension three and some related edge-covering characteristics of graphs, Generating sets for lattices of dimension two, Time functions as utilities, Quaternary dichotomous voting rules, A structure theory for ordered sets, Circle orders and angle orders, Sphere orders, On the Ferrers dimension of a digraph, Ordered sets: retracts and connections, Continuous multi-utility representations of preorders, Representing preferences using intervals, Multiutility representations for incomplete difference preorders, Some order dimension bounds for communication complexity problems, On the order dimension of outerplanar maps, Dimension and automorphism groups of lattices, A note on infinite triangulated graphs, The interval inclusion number of a partially ordered set, Random orders of dimension 2, Binary relations: Finite characterizations and computational complexity, The computational complexity of rationalizing Pareto optimal choice behavior, Cycle-free partial orders and chordal comparability graphs, Transitive closure for restricted classes of partial orders, On the number of monotone sequences, On graphs associated to sets of rankings, Modelling the reliability of paired comparisons, Splitting metrics by \(T_0\)-quasi-metrics, Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices), Attack allocation on remote state estimation in multi-systems: structural results and asymptotic solution, Answer to some open questions on covering dimension for finite lattices, New constructions for provably-secure time-bound hierarchical key assignment schemes, Democracy and efficiency: A note on ``Arrow's theorem is not a surprising result, Inequalities for the number of linear extensions, An implicit representation of chordal comparability graphs in linear time, Witness (Delaunay) graphs, Implications of Pareto efficiency for two-agent (household) choice, Certain partially ordered sets of dimension three, Non-Archimedean extensive measurement with incomparability, Arbres et dimension des ordres, On the size of maximal chains and the number of pairwise disjoint maximal antichains, \(\mathcal V\)-free products of Hopfian lattices, Note on the order dimension of partially ordered sets, Efficient provably-secure hierarchical key assignment schemes, Comparability graphs and a new matroid, On incomplete preference structures, Grid intersection graphs and order dimension, An upper bound on the dimension of interval orders, Infinite digraphs with given regular automorphism groups, Duality for semiantichains and unichain coverings in products of special posets, Conditional ordering extensions, Dimensions of hypergraphs, Localized and compact data-structure for comparability graphs, Matching relations and the dimensional structure of social choices, Angle orders, Dimension preserving contractions and a finite list of 3-irreducible posets, On-line chain partitions of orders: a survey, On minimal prime graphs and posets, Quotients of complete ordered sets, On realizable biorders and the biorder dimension of a relation, Random orders, Interval graphs and related topics, Endomorphisms and homomorphisms of Heyting algebras, On the greedy dimension of a partial order, The Erdős-Dushnik-Miller theorem for topological graphs and orders, On the number of k-realizations of an ordered set, Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
