Combinatorics of lopsided sets
From MaRDI portal
Publication:2488836
DOI10.1016/j.ejc.2005.03.001zbMath1087.05059OpenAlexW2101708843MaRDI QIDQ2488836
Hans-Jürgen Bandelt, Victor Chepoi, Jack H. Koolen, Andreas W. M. Dress
Publication date: 16 May 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.03.001
Extremal set theory (05D05) Distance in graphs (05C12) Combinatorial complexity of geometric structures (52C45)
Related Items
Medians in median graphs and their cube complexes in linear time, Unlabeled sample compression schemes and corner peelings for ample and maximum classes, Convex excess in partial cubes, Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids, Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry, Shattering, graph orientations, and connectivity, On partial cubes, well-graded families and their duals with some applications in graphs, Subquadratic-time algorithm for the diameter and all eccentricities on median graphs, First-order logic axiomatization of metric graph theory, COMs: complexes of oriented matroids, Sign rank versus Vapnik-Chervonenkis dimension, A Sauer-Shelah-Perles lemma for lattices, Distance-preserving subgraphs of Johnson graphs, Combinatorics of lopsided sets, Unnamed Item, Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor, Standard monomials and extremal point sets, Labeled Compression Schemes for Extremal Classes, Two-dimensional partial cubes
Cites Work
- The theory of convex geometries
- Lopsided sets and orthant-intersection by convex sets
- Superextensions and the depth of median graphs
- On the number of vertices and edges of the Buneman graph
- Median algebras
- Combinatorics of lopsided sets
- Distance-preserving subgraphs of hypercubes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
