Summary
Two classical examples of antimatroids arise from double shellings of partially ordered sets and from simplicial shellings of triangulated graphs. The corresponding convex geometries have Carathéodory number two and admit a natural description in terms of the ternary relation of betweenness in the underlying structure. We characterize a nested pair of classes of betweenness which generate convex geometries of Carathéodory number two. The corresponding antimatroids include all antimatroids arising from double shellings of partially oredred sets and all antimatroids arising from simplicial shellings of triangulated graphs.
This research was funded by the Canada Research Chairs Program and by the Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Calder, J.R.: Some elementary properties of interval convexities. J. Lond. Math. Soc. 3(2), 422–428 (1971)
Dietrich, B.L.: A circuit set characterization of antimatroids. J. Comb. Theory Ser. B 43, 314–321 (1987)
Dilworth, R.P.: Lattices with unique irreducible decompositions. Ann. Math. 41(2), 771–777 (1940)
Dirac, G.A.: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25, 71–76 (1961)
Duchet, P.: Convex sets in graphs. II. Minimal path convexity. J. Comb. Theory, Ser. B 44, 307–316 (1988)
Edelman, P.H.: Meet-distributive lattices and the anti-exchange closure. Algebra Univers. 10, 290–299 (1980)
Edelman, P.H., Jamison, R.E.: The theory of convex geometries. Geom. Dedic. 19, 247–270 (1985)
Farber, M., Jamison, R.E.: Convexity in graphs and hypergraphs. SIAM J. Algebr. Discrete Methods 7, 433–444 (1986)
Jamison-Waldner, R.E.: Copoints in antimatroids. Congr. Numer. 29, 535–544 (1980)
Jamison-Waldner, R.E.: A perspective on abstract convexity: classifying alignments by varieties. In: Convexity and Related Combinatorial Geometry, Norman, Okla, 1980. Lecture Notes in Pure and Applied Mathematics, vol. 76, pp. 113–150. Dekker, New York (1982)
Kay, D.C., Womble, E.W.: Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers. Pac. J. Math. 38, 471–485 (1971)
Korte, B., Lovász, L.: Mathematical structures underlying greedy algorithms. In: Fundamentals of Computation Theory, Szeged, 1981. Lecture Notes in Computer Science, vol. 117, pp. 205–209. Springer, Berlin (1981)
Korte, B., Lovász, L.: Greedoids—a structural framework for the greedy algorithm. In: Progress in Combinatorial Optimization, Waterloo, Ont., 1982, pp. 221–243. Academic Press, Toronto (1984)
Korte, B., Lovász, L., Schrader, R.: Greedoids. Springer, Berlin (1991)
Lihová, J.: Strict order-betweennesses. Acta Univ. M. Belii Ser. Math. 8, 27–33 (2000). http://matematika.fpv.umb.sk/papers8.ps
Whitney, H.: On the abstract properties of linear dependence. Am. J. Math. 57, 509–533 (1935)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chvátal, V. (2009). Antimatroids, Betweenness, Convexity. In: Cook, W., Lovász, L., Vygen, J. (eds) Research Trends in Combinatorial Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76796-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-76796-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76795-4
Online ISBN: 978-3-540-76796-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)