An order-theoretic perspective on categorial closure operators

This paper deals with an order-theoretic analysis of certain structures studied in category theory. A categorical closure operator (cco in short) is a structure on a category, which mimics the structure on the category of topological spaces formed by closing subspaces of topological spaces. Such structures play a significant role not only in categorical topology, but also in topos theory and categorical algebra. In the case when the category is a poset, as a particular instance of the notion of a cco, one obtains what we call in this paper a binary closure operator (bco in short). We show in this paper that bco’s allow one to see more easily the connections between standard conditions on general cco’s, and furthermore, we show that these connections for cco’s can be even deduced from the corresponding ones for bco’s, when considering cco’s relative to a well-behaved class of monorphisms as in the literature. The main advantage of the approach to such cco’s via bco’s is that the notion of a bco is self-dual (relative to the usual posetal duality), and by applying this duality to cco’s, independent results on cco’s are brought together. In particular, we can unify basic facts about hereditary closure operators with similar facts about minimal closure operators. Bco’s also reveal some new links between categorical closure operators, the usual unary closure and interior operators, modularity law in order and lattice theory, the theory of factorization systems and torsion theory.     

Weighted domination of cocomparability graphs

It is shown in this paper that the weighted domination problem and its three variants, the weighted connected domination, total domination, and dominating clique problems are NP-complete on cobipartite graphs when arbitrary integer vertex weights are allowed and all of them can be solved in polynomial time on cocomparability graphs if vertex weights are integers and less than or equal to a constant c. The results are interesting because cocomparability graphs properly contain cobipartite graphs and the cardinality cases of the above problems are trivial on cobipartite graphs. On the other hand, an O(¦V¦²) algorithm is given for the weighted independent perfect domination problem of a cocomparability graph G = (V.E).     

Fixed points of posets and clique graphs

The fixed point property for partial orders has been the object of much attention in the past twenty years. Recently, M. Roddy ([7]) proved this famous conjecture of Rival (see [6]): the class of finite orders with the fixed point property is closed under finite products.In this article, we prove that a finite order has the fixed point property if the sequence of iterated clique graphs of its comparability graph tends to the trivial graph.     

Random graphs and covering graphs of posets

For a graph G, we define c(G) to be the minimal number of edges we must delete in order to make G into a covering graph of some poset. We prove that, if p=n ^-1+(n) ,where (n) is bounded away from 0, then there is a constant k ₀>0 such that, for a.e. G _p , c(G _p )k ₀ n ¹⁺⁽ⁿ⁾ .In other words, to make G _p into a covering graph, we must almost surely delete a positive constant proportion of the edges. On the other hand, if p=n ^-1+(n) , where (n)0, thenc(G _p )=o(n ¹⁺⁽ⁿ⁾ ), almost surely.Partially supported by MCS Grant 8104854.     

Sources in posets and comparability graphs

A vertex in a poset is a source if its indegree is zero. Further, a vertex in a comparability graph G is a source if there is a transitive orientation of G in which is a source. We characterize sources in comparability graphs in terms of forbidden subgraphs. Certain results follow, including a brief proof of a theorem by Olariu.     

Invariants of finite comparability graphs

We study some invariants of finite comparability graphs. This research was supported by the NSERC of Canada.     

The number of linear extensions of bipartite graphs

The number of linear extensions among the orientations of a bipartite graph is maximum just if the orientation itself is bipartite, the natural one.     

Chordal bipartite graphs and crowns

We prove that a bipartite graph is chordal if and only if it has an elimination scheme. This leads to a polynomial algorithm to recognize whether an ordered set is cycle-free.     

Cycle-free partial orders and chordal comparability graphs

This paper studies a number of problems on cycle-free partial orders and chordal comparability graphs. The dimension of a cycle-free partial order is shown to be at most 4. A linear time algorithm is presented for determining whether a chordal directed graph is transitive, which yields an O(n ²) algorithm for recognizing chordal comparability graphs. An algorithm is presented for determining whether the transitive closure of a digraph is a cycle-free partial order in O(n+m _t)time, where m _tis the number of edges in the transitive closure.     

Planar acyclic oriented graphs

A plane Hasse representation of an acyclic oriented graph is a drawing of the graph in the Euclidean plane such that all arcs are straight-line segments directed upwards and such that no two arcs cross. We characterize completely those oriented graphs which have a plane Hasse representation such that all faces are bounded by convex polygons. From this we derive the Hasse representation analogue, due to Kelly and Rival of Fary's theorem on straight-line representations of planar graphs and the Kuratowski type theorem of Platt for acyclic oriented graphs with only one source and one sink. Finally, we describe completely those acyclic oriented graphs which have a vertex dominating all other vertices and which have no plane Hasse representation, a problem posed by Trotter.     

Compatible connectedness in graphs and topological spaces

A topology on the vertex set of a graphG iscompatible with the graph if every induced subgraph ofG is connected if and only if its vertex set is topologically connected. In the case of locally finite graphs with a finite number of components, it was shown in [11] that a compatible topology exists if and only if the graph is a comparability graph and that all such topologies are Alexandroff. The main results of Section 1 extend these results to a much wider class of graphs. In Section 2, we obtain sufficient conditions on a graph under which all the compatible topologies are Alexandroff and in the case of bipartite graphs we show that this condition is also necessary.     

A remark on covering graphs

Every graph G may be transformed into a covering graph either by deletion of edges or by subdivision. Let _E (G) and _V (G) denote corresponding minimal numbers. We prove _E (G) = _V (G) for every graph G.     

A new lattice construction

We introduce a new construction for orders and lattices. This construction is used to create large locally finite lattice varieties with uncountably many subvarieties.Dedicated to the memory of Ivan RivalReceived October 7, 2003; accepted in final form July 13, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching

We give the solution to the following question of C. D. Godsil[2]: Among the bipartite graphsG with a unique perfect matching and such that a bipartite graph obtains when the edges of the matching are contracted, characterize those having the property thatG ⁺G, whereG ⁺ is the bipartite multigraph whose adjacency matrix,B ⁺, is diagonally similar to the inverse of the adjacency matrix ofG put in lower-triangular form. The characterization is thatG must be obtainable from a bipartite graph by adding, to each vertex, a neighbor of degree one. Our approach relies on the association of a directed graph to each pair (G, M) of a bipartite graphG and a perfect matchingM ofG.     

Separator orders in interval, cocomparability, and AT-free graphs

We introduce a new type of order of sets of vertices. Using this concept, we describe the structure and the relationship between chordal, interval, cocomparability, and asteriodal triple-free graphs.     

Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs

For a countable ultrahomogeneous graph G=〈G,ρ〉$\mathbb{G}=〈G,\rho 〉$ let P(G)$\mathbb{P}(\mathbb{G})$ denote the collection of sets A⊂G$A\subset G$ such that 〈A,ρ∩[A]²〉≅G$〈A,\rho \cap {[A]}^2〉\cong \mathbb{G}$. The order types of maximal chains in the poset 〈P(G)∪{∅},⊂〉$〈\mathbb{P}(\mathbb{G})\cup \{\varnothing \},\subset 〉$ are characterized as:     

Planar graphs and poset dimension

We view the incidence relation of a graph G=(V. E) as an order relation on its vertices and edges, i.e. a<_G b if and only of a is a vertex and b is an edge incident on a. This leads to the definition of the order-dimension of G as the minimum number of total orders on V E whose intersection is <_G. Our main result is the characterization of planar graphs as the graphs whose order-dimension does not exceed three. Strong versions of several known properties of planar graphs are implied by this characterization. These properties include: each planar graph has arboricity at most three and each planar graph has a plane embedding whose edges are straight line segments. A nice feature of this embedding is that the coordinates of the vertices have a purely combinatorial meaning.     

The core of a chain complete poset with no one-way infinite fence and no tower

Like dismantling for finite posets, a perfect sequence = P : of a chain complete posetP represents a canonical procedure to produce a coreP . It has been proved that if the posetP contains no infinite antichain then this coreP is a retract ofP andP has the fixed point property iffP has this property. In this paper the condition of having no infinite antichain is replaced by a weaker one. We show that the same conclusion holds under the assumption thatP does not contain a one-way infinite fence or a tower.Supported by a grant from The National Natural Science Foundation of China.     

Weak orders admitting a perpendicular linear order

Two orders on the same set are perpendicular if the constant maps and the identity map are the only maps preserving both orders. We characterize the finite weak orders admitting a perpendicular linear order.     

Partial order complementation graphs

Two partial ordersP andQ on a setX arecomplementary (written asPQ) if they share no ordered pairs (except for loops) but the transitive closure of the union is all possible ordered pairs. For each positive integern we form a graph Pos _n consisting of all nonempty partial orders on {1, ,n} with edges denoting complementation. We investigate here properties of the graphs Pos _n . In particular, we show: