Antimatroids, Betweenness, Convexity

DOI10.1007/978-3-540-76796-1_3zbMath1359.05018MaRDI QIDQ2971604

Vašek Chvátal

Publication date: 7 April 2017

Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_3

Mathematics Subject Classification ID

68R05: Combinatorics in computer science

90C27: Combinatorial optimization

05B35: Combinatorial aspects of matroids and geometric lattices

Related Items

Betweenness of partial orders, Betweenness in Order-Theoretic Trees, Betweenness relations and gated sets in fuzzy metric spaces, Conceptual orthospaces -- convexity meets negation, Strict betweennesses induced by posets as well as by graphs, Characterizations of the convex geometries arising from the double shellings of posets, On subbetweennesses of trees: hardness, algorithms, and characterizations, Antimatroids and balanced pairs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Greedoids
• The theory of convex geometries
• A circuit set characterization of antimatroids
• Convex sets in graphs. II: Minimal path convexity
• Meet-distributive lattices and the anti-exchange closure
• Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
• Lattices with unique irreducible decompositions
• Convexity in Graphs and Hypergraphs
• On the Abstract Properties of Linear Dependence
• Some Elementary Properties of Interval Convexities