scientific article; zbMATH DE number 3757213
From MaRDI portal
Publication:3940405
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) Axiomatic and generalized convexity (52A01)
Cited in
(58)- Canonical and monophonic convexities in hypergraphs
- Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
- Exchange properties of combinatorial closure spaces
- Distance-hereditary graphs
- On local convexity in graphs
- Homotopy properties of greedoids
- Homomorphisms and Ramsey properties of antimatroids
- Bridged graphs and geodesic convexity
- The structure of hemispaces in \({\mathbb{R}}^ n\)
- A circuit set characterization of antimatroids
- Convex sets in graphs. II: Minimal path convexity
- Restricted-oriented convex sets
- Some properties of graph centroids
- Functional dependencies in relational databases: A lattice point of view
- An abstract duality
- Dependence systems with the operator-image exchange property
- An order theoretic framework for overlapping clustering
- Multidimensional medians arising from geodesics on graphs
- Visibility in semi-convex spaces
- The forbidden minor characterization of line-search antimatroids of rooted digraphs
- Closure systems and their structure
- Closure spaces that are not uniquely generated
- Exchange systems
- A decompositin theorem for convexity spaces
- On fuzzy topology fuzzy convexity spaces and fuzzy local convexity
- Convexity in ordered matroids and the generalized external order
- Transformations of discrete closure systems
- Polymatroid greedoids
- The intersection of matroids and antimatroids
- Antimatroids and balanced pairs
- An algorithmic characterization of antimatroids
- Resolutions of convex geometries
- Pretrees and arborescent convexities
- Antimatroids, betweenness, convexity
- Finding a maximum-weight convex set in a chordal graph
- Convexity in Graphs and Hypergraphs
- scientific article; zbMATH DE number 3960416 (Why is no real title available?)
- scientific article; zbMATH DE number 4038632 (Why is no real title available?)
- scientific article; zbMATH DE number 95268 (Why is no real title available?)
- scientific article; zbMATH DE number 529902 (Why is no real title available?)
- Alignments closed under a binary product
- Pretrees and the shadow topology
- Axioms for convexity
- On the monophonic convexity in complementary prisms
- Efficient realizations of closure systems
- Strict betweennesses induced by posets as well as by graphs
- Peakless functions on graphs
- The convex set forming game
- Convex geometry of building sets
- Matroids and antimatroids - a survey
- The edge intersection graphs of paths in a tree
- Some aspects of perfect elimination orderings in chordal graphs
- A Helly theorem for convexity in graphs
- Chip-firing games on graphs
- Centers of triangulated graphs
- Turán theorems and convexity invariants for directed graphs
- The induced path function, monotonicity and betweenness
- Complexity results related to monophonic convexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3940405)
