Cycle-free Partial Orders and Ends of Graphs
نویسنده
چکیده
The relationship between posets that are cycle-free and graphs that have more than one end is considered. We show that any locally finite bipartite graph corresponding to a cycle-free partial order has more than one end, by showing a correspondence between the ends of the graph and those of the Hasse graph of its Dedekind–MacNeille completion. If, in addition, the cycle-free partial order is k-CS-transitive for some k ≥ 3 we show that the associated graph is end-transitive. Using this approach we go on to prove that, for infinite locally finite 3-CS-transitive posets with maximal chains of height 2, the properties of being crown-free and being cycle-free are equivalent. In contrast to this we show that the non-locally finite bipartite graphs arising from skeletal cycle-free partial orders each have only one end. We include a corrected proof of a result from an earlier paper on the axiomatizability of the class of cycle-free partial orders.
منابع مشابه
On trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملThe niche graphs of doubly partial orders
The competition graph of a doubly partial order is known to be an interval graph. The competition-common enemy graph of a doubly partial order is also known to be an interval graph unless it contains a cycle of length 4 as an induced subgraph. In this paper, we show that the niche graph of a doubly partial order is not necessarily an interval graph. In fact, we prove that, for each n ≥ 4, there...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملElementary Properties of Cycle-free Partial Orders and their Automorphism Groups
1. Abstract A classiication was given in 1, 12, 13] of all the countable k-CS-transitive cycle-free partial orders for k 3. Here the elementary theories of these structures and their automorphism groups are examined, and it is shown that in many cases we can distinguish the structures or their groups by means of their rst or second order properties. The small index property is established for w...
متن کامل