Intersection patterns of convex sets
From MaRDI portal
Publication:762464
DOI10.1007/BF02761162zbMath0557.52005OpenAlexW1984324531MaRDI QIDQ762464
Publication date: 1984
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02761162
Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (65)
Leray numbers of complexes of graphs with bounded matching number ⋮ Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ On piercing numbers of families satisfying the \((p,q)_{r}\) property ⋮ Hyperconnectivity of graphs ⋮ The order dimension of two levels of the Boolean lattices ⋮ Circulant almost cross intersecting families ⋮ Inequalities for two set systems with prescribed intersections ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Bounding the piercing number ⋮ Bounding multiplicity by shifts in the Taylor resolution ⋮ A note on the colorful fractional Helly theorem ⋮ Improved bounds on the Hadwiger-Debrunner numbers ⋮ On the kernel of intersecting families ⋮ Intersection properties of boxes. I: An upper-bound theorem ⋮ Piercing convex sets ⋮ Set systems related to a house allocation problem ⋮ A Tverberg-type result on multicolored simplices ⋮ Combinatorial properties of nonarchimedean convex sets ⋮ An asymptotic resolution of a conjecture of Szemerédi and Petruska ⋮ Applications of graph containers in the Boolean lattice ⋮ Problems and results on 1-cross-intersecting set pair systems ⋮ Interview with Gil Kalai ⋮ Fractional Helly theorem for Cartesian products of convex sets ⋮ Theorems of Carathéodory, Helly, and Tverberg without dimension ⋮ Intersection patterns of planar sets ⋮ On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs ⋮ The Upper‐Bound Theorem for Families of Boxes in ℝ d ⋮ Berge's theorem, fractional Helly, and art galleries ⋮ Combinatorial generalizations of Jung's theorem ⋮ Helly’s theorem: New variations and applications ⋮ Nerves, minors, and piercing numbers ⋮ Helly-Type Theorems in Property Testing ⋮ Large cliques in hypergraphs with forbidden substructures ⋮ A fractional Helly theorem for boxes ⋮ A note on induced cycles in Kneser graphs ⋮ Intersection properties of boxes. II: Extremal families ⋮ Saturated \(r\)-uniform hypergraphs ⋮ Turán and Ramsey Properties of Subcube Intersection Graphs ⋮ Quantitative fractional Helly and \((p,q)\)-theorems ⋮ Obstructions to convexity in neural codes ⋮ Bounded degrees and prescribed distances in graphs ⋮ Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem ⋮ What Makes a Neural Code Convex? ⋮ Radon numbers and the fractional Helly theorem ⋮ The jump number of suborders of the power set order ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ Quantitative combinatorial geometry for concave functions ⋮ Collapsibility of non-cover complexes of graphs ⋮ Common transversals in the plane: The fractional perspective ⋮ A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane ⋮ Matchings and covers in hypergraphs ⋮ A Helly type theorem for hypersurfaces ⋮ Bollobás-type theorems for hemi-bundled two families ⋮ Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Collapsibility of simplicial complexes of hypergraphs ⋮ On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method ⋮ Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions ⋮ An extremal problem for sets with applications to graph theory ⋮ Helly-type problems ⋮ A simple proof of the upper bound theorem ⋮ Solution of an extremal problem for sets using resultants of polynomials ⋮ Transversal numbers for hypergraphs arising in geometry ⋮ Density results for uniform families ⋮ A fractional Helly theorem for convex lattice sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- A simple proof of the upper bound theorem
- Hyperconnectivity of graphs
- An extremal problem for two families of sets
- d-collapsing and nerves of families of convex sets
- A Turan type problem for interval graphs
- Sur la forme des espaces topologiques et sur les points fixes des représentations
- A Problem of Geometry in R n
- Boxes in Rn —A ‘Fractional’ Theorem
- Incidence Matrices of Subsets—A Rank Formula
- Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.
This page was built for publication: Intersection patterns of convex sets
