Antimatroids and balanced pairs

DOI10.1007/s11083-013-9289-1zbMath1292.05074arXiv1302.5967OpenAlexW3106223539MaRDI QIDQ2454046

David Eppstein

Publication date: 12 June 2014

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

antimatroidbalanced pairelimination ordering\(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some aspects of perfect elimination orderings in chordal graphs
• Greedoids
• New graph classes of bounded clique-width
• The theory of convex geometries
• Combinatorial representation and convex dimension of convex geometries
• Balance theorems for height-2 posets
• On metric properties of certain clique graphs
• Balanced pairs in partial orders
• Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
• Semiorders and the 1/3-2/3 conjecture
• On simple characterizations of k-trees
• Balancing pairs and the cross product conjecture
• Reverse search for enumeration
• Balancing poset extensions
• The gold partition conjecture
• An algorithmic characterization of antimatroids
• Antimatroids, Betweenness, Convexity
• Learning Spaces
• The Information-Theoretic Bound is Good for Merging
• A Characterization of Block-Graphs
• The Theory of Round Robin Tournaments

This page was built for publication: Antimatroids and balanced pairs