Convex geometries are extremal for the generalized Sauer-Shelah bound

zbMath1388.05184MaRDI QIDQ1640207

Bogdan Chornomaz

Publication date: 14 June 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p35

zbMATH Keywords

convex geometriesextremal latticesSauer-Shelah lemma

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Axiomatic and generalized convexity (52A01) Extremal set theory (05D05)

Related Items (3)

What convex geometries tell about shattering-extremal systems ⋮ A Sauer-Shelah-Perles lemma for lattices ⋮ Shattering-extremal set systems from Sperner families

Cites Work

• Greedoids
• A circuit set characterization of antimatroids
• Meet-distributive lattices and the anti-exchange closure
• On the trace of finite sets
• Lattices with unique irreducible decompositions
• Convex Geometries
• Extremal Combinatorics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex geometries are extremal for the generalized Sauer-Shelah bound