Combinatorics and ordered sets: proceedings of the AMS-IMS-SIAM joint summer research conference, held August 11-17, 1985 ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Radon transforms in combinatorics and lattice theory
Recursive ordered sets
Orientations and reorientations of graphs
5 other sections not shown
2-Helly property absolute retracts algebra algorithm antichain antichain cutset chain cover combinatorial comparability graph conjecture construction contains convex correlated covering graph defined denote Dilworth's directed graph distance distributive lattice edges embeds equivalent example exists expansion game expansive map Figure finite cutset finite ordered set function geometric lattice graph G Heyting hole-preserving maps hyperconvex space incidence matrix inequality infinite integer intersection interval orders involution isometric J.Ginsburg K-player Lemma linear extension linear ordering m-cutset property m-d lattices m-machine problem m-machine schedule map f Math maximal antichain maximal chain metric form metric spaces modular lattices morphism non-expansive mapping notion optimal order ideals orientations pair partially ordered sets polynomial posets Pouzet proof Proposition prove Radon transform rank reconstructed recursive chains recursive dimension recursive ordered sets reflexive retracts with respect Rival satisfies semigroup semigroup operation semimodular lattice sequence series-parallel subspace Theorem theory vertices width winning strategy