Abstract
We give a brief overview of the axiomatic development of betweenness relations, and investigate the connections between these and comparability graphs. Furthermore, we characterize betweenness relations induced by reflexive and antisymmetric binary relations, thus generalizing earlier results on partial orders. We conclude with a sketch of the algorithmic aspects of recognizing induced betweenness relations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Altwegg, M.: Zur Axiomatik der teilweise geordneten Mengen. Commentarii Mathematici Helvetici 24, 149–155 (1950)
Birkhoff, G.: Lattice Theory, 2nd revised edn. American Mathematical Society (1948)
Düvelmeyer, N., Wenzel, W.: A characterization of ordered sets and lattices via betweenness relations. Resultate der Mathematik 46, 237–250 (2004)
Ghouila-Houri, A.: Caractérisation des graphes non orientés dont on peut orienter les arêtes de manière à obtenir le graphe d’une relation d’ordre. C.R. Acad. Sci. Paris, pp. 1370–1371 (1962)
Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canadian Journal of Mathematics 16, 539–548 (1964)
Golumbic, M.C.: Comparability graphs and a new matroid. Journal of Combinato-rial Theory 22, 68–90 (1977)
Golumbic, M.C.: The complexity of comparability graph recognition and coloring. Computing 18, 199–208 (1977)
Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)
Huntington, E.V.: A new set of postulates for betweenness, with proof of complete independence. Trans. Am Math. Soc. 26, 257–282 (1924)
Huntington, E.V., Kline, J.R.: Set of independent postulates for betweenness. Trans. Am. Math. Soc. 18, 301–325 (1917)
Kelly, D.: Comparability graphs. In: Rival, I. (ed.) Graphs and Order, pp. 3–40. D. Reidel Publishing Company (1985)
Menger, K.: Untersuchungen über die allgemeine Metrik. Mathematische Annalen 100, 75–163 (1928)
Möhring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Order, pp. 41–101. D. Reidel Publishing Company (1985)
Pitcher, E., Smiley, M.F.: Transitivities of betweenness. Trans. Am. Math. Soc. 52, 95–114 (1942)
Sholander, M.: Trees, lattices, order and betweenness. Proc. Am. Math. Soc. 3(3), 369–381 (1952)
Tarski, A., Givant, S.: Tarski’s system of geometry. The Bulletin of Symbolic Logic 5(2), 175–214 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Düntsch, I., Urquhart, A. (2006). Betweenness and Comparability Obtained from Binary Relations. In: Schmidt, R.A. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2006. Lecture Notes in Computer Science, vol 4136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11828563_10
Download citation
DOI: https://doi.org/10.1007/11828563_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37873-0
Online ISBN: 978-3-540-37874-7
eBook Packages: Computer ScienceComputer Science (R0)