The following pages link to Partially Ordered Sets (Q5780132):
Displaying 50 items.
- On minimal prime graphs and posets (Q1047188) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- Random orders (Q1058533) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Endomorphisms and homomorphisms of Heyting algebras (Q1061758) (← links)
- The Erdős-Dushnik-Miller theorem for topological graphs and orders (Q1063007) (← links)
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets) (Q1066924) (← links)
- Decomposing weighted digraphs into sums of chains (Q1084404) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- On the separation of two relations by a biorder or a semiorder (Q1087450) (← links)
- A note on Dilworth's theorem in the infinite case (Q1093655) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Chains, antichains, and fibres (Q1098863) (← links)
- On finding the bidimension of a relation (Q1099113) (← links)
- Angle orders, regular n-gon orders and the crossing number (Q1101471) (← links)
- Ranking functions and axioms for linear orders (Q1103655) (← links)
- Some results on similarities in \({\mathbb{R}}^ n\) (Q1105070) (← links)
- Covering posets (Q1108294) (← links)
- Edge subdivision and dimension (Q1108295) (← links)
- Interval orders and circle orders (Q1114720) (← links)
- On circle containment orders (Q1117256) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- A counterexample in the theory of random orders (Q1121295) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- Asymptotic enumeration of two-dimensional posets (Q1122599) (← links)
- The rank of a distributive lattice (Q1132904) (← links)
- Sur les extensions linéaires d'une famille particuliere d'ordres partiels (Q1138563) (← links)
- On a product dimension of graphs (Q1142231) (← links)
- Complexity of dimension three and some related edge-covering characteristics of graphs (Q1143791) (← links)
- Generating sets for lattices of dimension two (Q1145163) (← links)
- A structure theory for ordered sets (Q1151913) (← links)
- On the Ferrers dimension of a digraph (Q1158180) (← links)
- Ordered sets: retracts and connections (Q1159221) (← links)
- Dimension and automorphism groups of lattices (Q1169489) (← links)
- A note on infinite triangulated graphs (Q1172073) (← links)
- The interval inclusion number of a partially ordered set (Q1176729) (← links)
- Random orders of dimension 2 (Q1177705) (← links)
- Cycle-free partial orders and chordal comparability graphs (Q1182042) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- Modelling the reliability of paired comparisons (Q1184251) (← links)
- Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices) (Q1193546) (← links)
- Democracy and efficiency: A note on ``Arrow's theorem is not a surprising result'' (Q1197649) (← links)
- Inequalities for the number of linear extensions (Q1198479) (← links)
- Certain partially ordered sets of dimension three (Q1218446) (← links)
- Arbres et dimension des ordres (Q1222175) (← links)
- \(\mathcal V\)-free products of Hopfian lattices (Q1225068) (← links)
- Note on the order dimension of partially ordered sets (Q1233878) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- An upper bound on the ''dimension of interval orders'' (Q1246441) (← links)
- Infinite digraphs with given regular automorphism groups (Q1251669) (← links)
