Representing posets with k-tournaments
Tóm tắt
In this paper, we introduce a binary relation on the vertex set of a k-tournament, and using this relation show that every finite poset with cardinality n≥4 can be represented by a k-tournament for every k satisfying 3≤k≤n−1.
Tài liệu tham khảo
Bialostocki, A. (1986) An application of the Ramsey theorem to ordered r-tournaments, Discrete Math. 61, 325–328.
Hiraguchi, T. (1955) On the dimension of orders, Sci. Rep. Kanazawa Univ. 4, 1–20.
Marshall, S. (1994) Properties of k-tournaments, Ph.D. Thesis, Simon Fraser University.
Trotter, W. T. and Moore, J. (1977) The dimension of planar posets, J. Comb. Theory B 21, 51–67.