Partition numbers for trees and ordered sets
From MaRDI portal
Publication:1162705
DOI10.2140/pjm.1981.96.115zbMath0482.52010OpenAlexW1550662968MaRDI QIDQ1162705
Publication date: 1981
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1981.96.115
posetranksemilatticeHelly numberCaratheodory numberconvex aligned spaceRadon m-partition numbersplit-tree
Partial orders, general (06A06) Other designs, configurations (05B30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Helly-type theorems and geometric transversal theory (52A35) Semilattices (06A12) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Related Items
The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey, Generalised Helly and Radon numbers, On local convexity in graphs, Near-linear-time algorithm for the geodetic Radon number of grids, Colorful Carathéodory, Helly and sierksma numbers of convexity spaces, Unnamed Item, Convex sets in graphs. II: Minimal path convexity, A Radon theorem for Helly graphs, Tverberg-type theorems for pseudoconfigurations of points in the plane, Quantitative Tverberg theorems over lattices and other discrete sets, A Helly theorem in weakly modular space, Tverberg numbers for cellular bipartite graphs, Radon numbers grow linearly, Partition coefficients of acyclic graphs, Efficient realizations of closure systems, Embeddings of \(k\)-complexes into \(2k\)-manifolds, A Tverberg-type generalization of the Helly number of a convexity space, Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem, An upper bound on the \(P_3\)-Radon number, Helly’s theorem: New variations and applications, The lattice of convex sets of an oriented matroid, The rank of product closure systems, Turán theorems and convexity invariants for directed graphs, Quantitative \((p, q)\) theorems in combinatorial geometry, Two-dimensional convexities are join-hull commutative, Convexities related to path properties on graphs, Radon numbers and the fractional Helly theorem, Graph theory (algorithmic, algebraic, and metric problems), Tverberg’s theorem is 50 years old: A survey, Radon numbers for trees, Unnamed Item, Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization, Unnamed Item, Finite dimensional convex structures. II: The invariants, Alignments closed under a binary product, An approach to building geometries based on points, lines and convexity, Finding a Maximum-Weight Convex Set in a Chordal Graph, On Eckhoff's conjecture for Radon numbers; or how far the proof is still away, The edge intersection graphs of paths in a tree, The Erdos-Szekeres problem on points in convex position – a survey, A Helly theorem for convexity in graphs, Transversal numbers for hypergraphs arising in geometry
