On the shelling antimatroids of split graphs

DOI10.1016/j.endm.2016.10.049zbMath1356.05022arXiv1512.06073OpenAlexW2963034392MaRDI QIDQ510993

Keno Merckx, Jean Cardinal, Jean-Paul Doignon

Publication date: 14 February 2017

Full work available at URL: https://arxiv.org/abs/1512.06073

zbMATH Keywords

posetsplit graphantimatroidshellingmaximum weight feasible set

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (1)

Finding a Maximum-Weight Convex Set in a Chordal Graph

Cites Work

• Unnamed Item
• Greedoids
• A circuit set characterization of antimatroids
• Meet-distributive lattices and the anti-exchange closure
• Choice functions and abstract convex geometries
• Cooperative games on antimatroids
• An algorithmic characterization of antimatroids
• Learning Spaces

This page was built for publication: On the shelling antimatroids of split graphs