Sciweavers

ORDER
2008
91views more  ORDER 2008»
13 years 4 months ago
Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
Manfred Droste, Robert Gray, John K. Truss
ORDER
2008
86views more  ORDER 2008»
13 years 4 months ago
Comparison of MacNeille, Canonical, and Profinite Completions
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean al...
Guram Bezhanishvili, Jacob Vosmaer
ORDER
2008
66views more  ORDER 2008»
13 years 4 months ago
Cover-Incomparability Graphs of Posets
Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matj...
ORDER
2008
82views more  ORDER 2008»
13 years 4 months ago
Profinite Heyting Algebras
For a Heyting algebra A, we show that the following conditions are equivalent: (i) A is profinite; (ii) A is finitely approximable, complete, and completely join-prime generated; (...
Guram Bezhanishvili, Nick Bezhanishvili
ORDER
2008
61views more  ORDER 2008»
13 years 4 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
ORDER
2008
60views more  ORDER 2008»
13 years 4 months ago
Fixed Points of Zircon Automorphisms
A zircon is a poset in which every principal order ideal is finite and equipped with a so-called special matching. We prove that the subposet induced by the fixed points of any aut...
Axel Hultman