Let U and V be open subsets of the Cantor set with finite disjoint complements, and let h : U → V be a homeomorphism with dense orbits. Building on the ideas of Herman, Putnam, and Skau, we show that the partial action induced by h can be realized as the Vershik map on a Bratteli diagram, and that any two such diagrams are equivalent.Of course, there are examples of ordered Bratteli diagrams which have a different number of maximal and minimal paths (see [4,5], also see Example 2.8) -in this case extending to a globally defined homeomorphism is impossible. In cases such as this, we still have that the Vershik map is a homeomorphism between open subsets of the path space, and we can hence study it as a partial action of Z (the Vershik map has been studied as a partially defined map before in the literature, see [23,27]).Partial actions were originally defined in [11] and gradually gained importance as many C*-algebras and algebras were realized as partial crossed products (approximately finite, Bunce-Deddens and Cuntz-Krieger algebras, graph algebras, Leavitt path algebras, algebras associated with integral domains, and self-similar graph algebras among others, see [6,8,12,13,14,16,24]). In the topological category a partial action of Z provides the correct setting to study the dynamics of a partial homeomorphism: given a homeomorphism h : U → V between two open sets of the topological space X one considers the iterates h n , with n ∈ Z, restricted to the appropriate domains. This is the approach taken in [11,15].It is our goal in this paper to link the theory of minimal partial actions of Z on the Cantor set with Bratteli diagrams. Our main result, Theorem 3.10 states that any minimal homeomorphism between open subsets of the Cantor set (whose complements are finite and disjoint) has a Bratteli-Vershik model. In our model the points in the complement of the open sets are identified with maximal and minimal paths in the Bratteli diagram.We divide our work in three sections. In Section 2 we recall background material on Bratteli diagrams and partial actions. In Section 3 we construct our Bratteli-Vershik model by first carefully developing a suitable "first return time" (Proposition 3.4), using that to construct an ordered Bratteli diagram (Proposition 3.7), and showing that the resulting Vershik map is isomorphic to our original homeomorphism (Theorem 3.10).Let B = (V, E) be a Bratteli diagram, and let E * be the set of all finite paths in B, including the vertices (treated as paths of length zero). That is, E * = {e 1 e 2 · · · e k | e i ∈ E, r(e i ) = s(e i+1 ) for 1 ≤ i ≤ k} ∪ V.