Some Elementary Properties of Interval Convexities
From MaRDI portal
Publication:5635959
DOI10.1112/jlms/s2-3.3.422zbMath0228.52001OpenAlexW2080040151MaRDI QIDQ5635959
Publication date: 1971
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-3.3.422
Related Items (25)
Induced path transit function, monotone and Peano axioms ⋮ Intervals and convex sets in strong product of graphs ⋮ Axiomatic characterization of transit functions of hierarchies ⋮ Convex sets in graphs. II: Minimal path convexity ⋮ The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results ⋮ Radon numbers grow linearly ⋮ On the Carathéodory number of interval and graph convexities ⋮ On the \(P_3\)-hull number of Hamming graphs ⋮ The maximum time of 2-neighbor bootstrap percolation: complexity results ⋮ Maximal closed set and half-space separations in finite closure systems ⋮ Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes ⋮ An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering ⋮ First-order logic axiomatization of metric graph theory ⋮ Antimatroids, Betweenness, Convexity ⋮ Toll convexity ⋮ The All-Paths Transit Function of a Graph ⋮ The induced path function, monotonicity and betweenness ⋮ Convexities related to path properties on graphs ⋮ Multilevel clustering models and interval convexities ⋮ Beziehungen zwischen den Sätzen von Radon, Helly und Caratheodory bei axiomatischen Konvexitäten ⋮ On the \(P_3\)-hull number of Kneser graphs ⋮ Intersecting sets in midset spaces. I ⋮ Combinatorial geometry ⋮ Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces ⋮ The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
This page was built for publication: Some Elementary Properties of Interval Convexities
