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)
- 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.
- Forcing posets with large dimension to contain large standard examples
- Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
- A note on the McKelvey uncovered set and Pareto optimality
- The proof of the removable pair conjecture for fractional dimension.
- Set functions and Souslin’s hypothesis
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
- Interval orders and circle orders
- Concerning a Certain Set of Arrangements
- Dimensions of hypergraphs
- A generalized permutahedron
- Dimension and matchings in comparability and incomparability graphs.
- A min-max property of chordal bipartite graphs with applications
- Analysis of multiple partially ordered responses to belief items with don't know option
- Efficient and non-deteriorating choice.
- Transitive closure for restricted classes of partial orders
- On the dimension of partially ordered sets
- The rank of a distributive lattice
- Comparability graphs and a new matroid
- A study of covering dimension for the class of finite lattices.
- Betweenness, orders and interval graphs
- On realizable biorders and the biorder dimension of a relation
- Some counterexamples in the partition calculus
- Edge subdivision and dimension
- Split semiorders
- Dimension of complete simple games with minimum
- Continuously representable Paretian quasi-orders
- The complexity of embedding orders into small products of chains
- On a strong continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller
- On polymorphism-homogeneous relational structures and their clones.
- A theory of recursive dimension of ordered sets
- On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar
- Quaternary dichotomous voting rules
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets
- Fractional dimension of partial orders
- Time functions as utilities
- Minors and dimension
- Permutation bigraphs and interval containments
- Szpilrajn, Arrow and Suzumura: concise proofs of extension theorems and an extension
- On the continuous analogue of the Szpilrajn theorem. I
- A recognition algorithm for orders of interval dimension two
- Ordered sets
- The computational complexity of rationalizing boundedly rational choice behavior
- A conjecture on the construction of orderings by Borda's rule
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Partially ordered knapsack and applications to scheduling
- Standard examples as subposets of posets.
- Tree-width and dimension
- Witness (Delaunay) graphs
- On the Ferrers dimension of a digraph
- MEASURING THE SIZE OF INFINITE COLLECTIONS OF NATURAL NUMBERS: WAS CANTOR’S THEORY OF INFINITE NUMBER INEVITABLE?
- Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
- On a product dimension of graphs
- Ordered sets with interval representation and \((m,n)\)-Ferrers relation
- Bounds on the \(k\)-dimension of products of special posets
- Bipolar orientations revisited
- Semistandard tableaux associated with generalized labellings of posets
- The Complexity of the Partial Order Dimension Problem
- An efficient implicit data structure for relation testing and searching in partially ordered sets
- Representing digraphs using intervals or circular arcs
- Dimension and automorphism groups of lattices
- 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)\)
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)