The following pages link to Partially Ordered Sets (Q5780132):
Displaying 50 items.
- Irreflexive and reflexive dimension (Q1894369) (← links)
- A generalized permutahedron (Q1905997) (← links)
- Representing digraphs using intervals or circular arcs (Q1910520) (← links)
- Dimension of fuzzy ordered sets (Q1914434) (← links)
- Interpretation of graphs in the lattices of dimension three (Q1921836) (← links)
- Timestamping messages and events in a distributed system using synchronous communication (Q1954214) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- A generalization of Moulin's Pareto extension theorem (Q1974053) (← links)
- On \(k\)-tree containment graphs of paths in a tree (Q2035089) (← links)
- Fractional local dimension (Q2035098) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Dynamic choice under familiarity-based attention (Q2068876) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Local dimension is unbounded for planar posets (Q2213803) (← links)
- A universal partition result for infinite homogeneous \(K_n\)-free and related graphs (Q2219943) (← links)
- Random bipartite posets and extremal problems (Q2220979) (← links)
- On polymorphism-homogeneous relational structures and their clones. (Q2257979) (← links)
- Applications of Ramsey theory (Q2266026) (← links)
- A theory of recursive dimension of ordered sets (Q2266723) (← links)
- Ordered sets with interval representation and \((m,n)\)-Ferrers relation (Q2271872) (← links)
- Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces (Q2274045) (← links)
- The graph of critical pairs of a crown (Q2279688) (← links)
- Cardinal characteristics of the continuum and partitions (Q2303677) (← links)
- On the topology of complexes of injective words (Q2304016) (← links)
- A generalization of Arrow's lemma on extending a binary relation (Q2330278) (← links)
- A study of covering dimension for the class of finite lattices. (Q2339426) (← links)
- Standard examples as subposets of posets. (Q2351724) (← links)
- An efficient implicit data structure for relation testing and searching in partially ordered sets (Q2366649) (← links)
- Semistandard tableaux associated with generalized labellings of posets (Q2371073) (← links)
- 2-dimension from the topological viewpoint (Q2385529) (← links)
- A half-space approach to order dimension (Q2385531) (← links)
- Tree-width and dimension (Q2400108) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Dimension of complete simple games with minimum (Q2470114) (← links)
- Embedding linear orders in grids (Q2491206) (← links)
- On a strong continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller (Q2494391) (← links)
- Anonymous monotonic social welfare functions (Q2496234) (← links)
- The embeddability ordering of topological spaces (Q2499780) (← links)
- Characterizing Paretian preferences (Q2500713) (← links)
- Maximal-element rationalizability (Q2502388) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Extensive measurement with incomparability (Q2517782) (← links)
- On multipartite posets (Q2519843) (← links)
- Über eine Eigenschaft der Dedekind-MacNeilleschen Hülle (Q2528387) (← links)
- Betweenness, orders and interval graphs (Q2546051) (← links)
- What if utility functions do not exist? (Q2557637) (← links)
- Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n (Q2560838) (← links)
- Some counterexamples in the partition calculus (Q2562856) (← links)
- A conjecture on the construction of orderings by Borda's rule (Q2629514) (← links)
