Partition numbers for trees and ordered sets
From MaRDI portal
Caratheodory numberconvex aligned spaceHelly numberposetRadon m-partition numberranksemilatticesplit-tree
Other designs, configurations (05B30) Partial orders, general (06A06) Semilattices (06A12) Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Helly-type theorems and geometric transversal theory (52A35) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cited in
(43)- On Eckhoff's conjecture for Radon numbers; or how far the proof is still away
- On local convexity in graphs
- Convex sets in graphs. II: Minimal path convexity
- A Radon theorem for Helly graphs
- Tverberg-type theorems for pseudoconfigurations of points in the plane
- A Helly theorem in weakly modular space
- A Tverberg-type generalization of the Helly number of a convexity space
- The lattice of convex sets of an oriented matroid
- The rank of product closure systems
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- Convexities related to path properties on graphs
- An approach to building geometries based on points, lines and convexity
- Transversal numbers for hypergraphs arising in geometry
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Tverberg numbers for cellular bipartite graphs
- Quantitative \((p, q)\) theorems in combinatorial geometry
- Radon numbers and the fractional Helly theorem
- Colorful Carathéodory, Helly and sierksma numbers of convexity spaces
- Two-dimensional convexities are join-hull commutative
- Quantitative Tverberg theorems over lattices and other discrete sets
- Radon numbers grow linearly
- Surmise relations between tests -- preliminary results of the mathematical modeling
- Helly’s theorem: New variations and applications
- Near-linear-time algorithm for the geodetic Radon number of grids
- Finding a maximum-weight convex set in a chordal graph
- scientific article; zbMATH DE number 3960416 (Why is no real title available?)
- Generalised Helly and Radon numbers
- scientific article; zbMATH DE number 60859 (Why is no real title available?)
- An upper bound on the \(P_3\)-Radon number
- The Erdos-Szekeres problem on points in convex position – a survey
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Tverberg’s theorem is 50 years old: A survey
- Alignments closed under a binary product
- Graph theory (algorithmic, algebraic, and metric problems)
- Partition coefficients of acyclic graphs
- Efficient realizations of closure systems
- Embeddings of k-complexes into 2k-manifolds
- A sharper Ramsey theorem for constrained drawings
- Radon numbers for trees
- Finite dimensional convex structures. II: The invariants
- The edge intersection graphs of paths in a tree
- A Helly theorem for convexity in graphs
- Turán theorems and convexity invariants for directed graphs
This page was built for publication: Partition numbers for trees and ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162705)
