scientific article
From MaRDI portal
Publication:3940405
zbMath0482.52001MaRDI QIDQ3940405
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Axiomatic and generalized convexity (52A01) Logical aspects of lattices and related structures (03G10) Combinatorial aspects of matroids and geometric lattices (05B35) Ordered sets (06A99) Relational systems, laws of composition (08A02) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items (57)
Exchange properties of combinatorial closure spaces ⋮ Distance-hereditary graphs ⋮ Dependence systems with the operator-image exchange property ⋮ Axioms for convexity ⋮ Pretrees and arborescent convexities ⋮ On local convexity in graphs ⋮ An order theoretic framework for overlapping clustering ⋮ Convexity in Graphs and Hypergraphs ⋮ On fuzzy topology fuzzy convexity spaces and fuzzy local convexity ⋮ Homotopy properties of greedoids ⋮ An algorithmic characterization of antimatroids ⋮ Homomorphisms and Ramsey properties of antimatroids ⋮ Multidimensional medians arising from geodesics on graphs ⋮ Bridged graphs and geodesic convexity ⋮ The structure of hemispaces in \({\mathbb{R}}^ n\) ⋮ A circuit set characterization of antimatroids ⋮ Visibility in semi-convex spaces ⋮ Convex sets in graphs. II: Minimal path convexity ⋮ Resolutions of convex geometries ⋮ Convexity in ordered matroids and the generalized external order ⋮ On the monophonic convexity in complementary prisms ⋮ Efficient realizations of closure systems ⋮ Strict betweennesses induced by posets as well as by graphs ⋮ The forbidden minor characterization of line-search antimatroids of rooted digraphs ⋮ Antimatroids, Betweenness, Convexity ⋮ Centers of triangulated graphs ⋮ Restricted-oriented convex sets ⋮ Antimatroids and balanced pairs ⋮ Some properties of graph centroids ⋮ Turán theorems and convexity invariants for directed graphs ⋮ Peakless functions on graphs ⋮ On the shelling antimatroids of split graphs ⋮ Transformations of discrete closure systems ⋮ Functional dependencies in relational databases: A lattice point of view ⋮ The induced path function, monotonicity and betweenness ⋮ Closure spaces that are not uniquely generated ⋮ Polymatroid greedoids ⋮ Complexity results related to monophonic convexity ⋮ The intersection of matroids and antimatroids ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An abstract duality ⋮ Unnamed Item ⋮ Matroids and antimatroids - a survey ⋮ Exchange systems ⋮ Alignments closed under a binary product ⋮ A decompositin theorem for convexity spaces ⋮ Canonical and monophonic convexities in hypergraphs ⋮ Unnamed Item ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph ⋮ The edge intersection graphs of paths in a tree ⋮ Some aspects of perfect elimination orderings in chordal graphs ⋮ Pretrees and the shadow topology ⋮ A Helly theorem for convexity in graphs ⋮ Chip-firing games on graphs ⋮ Closure systems and their structure ⋮ Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
This page was built for publication:
