Partially Ordered Sets
From MaRDI portal
Publication:5780132
DOI10.2307/2371374zbMATH Open0025.31002OpenAlexW2325654786WikidataQ59509276 ScholiaQ59509276MaRDI QIDQ5780132FDOQ5780132
Publication date: 1941
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/be44f6333785f87efb011bb3c026ced8c0a90488
Cited In (only showing first 100 items - show all)
- The Dimension of a Comparability Graph
- Angle orders
- Dimension of fuzzy ordered sets
- N-free posets as generalizations of series-parallel posets
- Two Double Poset Polytopes
- Complexity of dimension three and some related edge-covering characteristics of graphs
- Sphere orders
- PARTIALLY ORDERED CONNECTIVES
- Angle orders, regular n-gon orders and the crossing number
- On circle containment orders
- A counterexample in the theory of random orders
- Partition relations for \(\kappa\)-normal ideals on \(P_{\kappa}(\lambda)\)
- Changing the Depth of an Ordered Set by Decomposition
- Random orders of dimension 2
- Random orders
- On the size of maximal chains and the number of pairwise disjoint maximal antichains
- Non-Archimedean extensive measurement with incomparability
- Simultaneous representation of interval and interval-containment orders
- On minimal prime graphs and posets
- Efficient provably-secure hierarchical key assignment schemes
- Grid intersection graphs and order dimension
- On incomplete preference structures
- Perfect sequences of chain-complete posets
- Mixed models, random utilities, and the triangle inequality
- The embeddability ordering of topological spaces
- A formal study of linearity axioms for fuzzy orderings
- A note on Dilworth's theorem in the infinite case
- Simultaneous dominance representation of multiple posets
- On the pseudodimension of ordered sets
- Circle orders and angle orders
- Maximum independent set and maximum clique algorithms for overlap graphs
- Spherical containment and the Minkowski dimension of partial orders
- Decomposing weighted digraphs into sums of chains
- On finding the bidimension of a relation
- Asymptotic enumeration of two-dimensional posets
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
- Dimension transitiv orientierbarer graphen
- Decidability and ℵ0-categoricity of theories of partially ordered sets
- Interval graphs and related topics
- On multipartite posets
- Classes of perfect graphs
- Ordered sets: retracts and connections
- Modelling the reliability of paired comparisons
- Extensive measurement with incomparability
- Matching relations and the dimensional structure of social choices
- A structure theory for ordered sets
- Computational aspects of the 2-dimension of partially ordered sets
- A note on the dimension of a poset
- Representing preferences using intervals
- On the number of monotone sequences
- Title not available (Why is that?)
- The Erdős-Dushnik-Miller theorem for topological graphs and orders
- On the separation of two relations by a biorder or a semiorder
- A Partition Theorem for Triples
- Dimension preserving contractions and a finite list of 3-irreducible posets
- On the order dimension of outerplanar maps
- The Complexity of the Partial Order Dimension Problem: Closing the Gap
- Quotients of complete ordered sets
- On the greedy dimension of a partial order
- The minimum cost shortest-path tree game
- Answer to some open questions on covering dimension for finite lattices
- Covering posets
- On the number of k-realizations of an ordered set
- Compact Spaces and Spaces of Maximal Complete Subgraphs
- A note about games-composition dimension
- Chains, antichains, and fibres
- Infinite digraphs with given regular automorphism groups
- Dimension of posets with planar cover graphs excluding two long incomparable chains
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Measures in Boolean Algebras
- Universal Infinite Partially Ordered Sets
- Attack allocation on remote state estimation in multi-systems: structural results and asymptotic solution
- Interval dimension and MacNeille completion
- Localized and compact data-structure for comparability graphs
- Steiner transitive-closure spanners of low-dimensional posets
- Title not available (Why is that?)
- New constructions for provably-secure time-bound hierarchical key assignment schemes
- A partition calculus in set theory
- Inequalities in Dimension Theory for Posets
- Continuous multi-utility representations of preorders
- Multiutility representations for incomplete difference preorders
- Title not available (Why is that?)
- On graphs associated to sets of rankings
- Splitting metrics by \(T_0\)-quasi-metrics
- Maximal-element rationalizability
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
- Anonymous monotonic social welfare functions
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- The Hardness of Approximating Poset Dimension
- A characterization of the \(n\)-agent Pareto dominance relation
- On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller
- A quasiordering is the intersection of orderings
- On-line chain partitions of orders: a survey
- Planar graphs and poset dimension
- Perpendicular orders
- The computational complexity of rationalizing Pareto optimal choice behavior
- Generalizations of semiorders: A review note
- Implications of Pareto efficiency for two-agent (household) choice
- Modular decomposition and transitive orientation
- The dimension for the European Union Council under the Nice rules.
This page was built for publication: Partially Ordered Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5780132)