Intersection patterns of convex sets
From MaRDI portal
Publication:762464
DOI10.1007/BF02761162zbMATH Open0557.52005OpenAlexW1984324531MaRDI QIDQ762464FDOQ762464
Authors: Gil Kalai 
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
Recommendations
- Intersection patterns of finite sets and of convex sets
- scientific article; zbMATH DE number 3883113
- Intersection patterns of planar sets
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Intersections of convex bodies
- On the intersection of two particular convex sets
- scientific article; zbMATH DE number 1354889
- scientific article; zbMATH DE number 3931900
- Intersection theorems for closed convex sets and applications
- Intersection patterns of curves
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work
- An extremal problem for two families of sets
- A Turan type problem for interval graphs
- A Problem of Geometry in R n
- Sur la forme des espaces topologiques et sur les points fixes des représentations
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- d-collapsing and nerves of families of convex sets
- A simple proof of the upper bound theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hyperconnectivity of graphs
- Title not available (Why is that?)
- Incidence Matrices of Subsets—A Rank Formula
- Boxes in Rn —A ‘Fractional’ Theorem
- Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.
Cited In (74)
- Applications of graph containers in the Boolean lattice
- Common transversals in the plane: The fractional perspective
- Problems and results on 1-cross-intersecting set pair systems
- Bounded degrees and prescribed distances in graphs
- What makes a neural code convex?
- Intersection patterns of linear subspaces with the hypercube
- Inequalities for two set systems with prescribed intersections
- A fractional Helly theorem for convex lattice sets
- On piercing numbers of families satisfying the \((p,q)_{r}\) property
- Improved bounds on the Hadwiger-Debrunner numbers
- Partitions of a polytope and mappings of a point set to facets
- Size and structure of large \((s,t)\)-union intersecting families
- Leray numbers of complexes of graphs with bounded matching number
- A simple proof of the upper bound theorem
- Algorithm Theory - SWAT 2004
- Quantitative combinatorial geometry for concave functions
- Saturated \(r\)-uniform hypergraphs
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Piercing convex sets
- Extremal \(G\)-free induced subgraphs of Kneser graphs
- A Tverberg-type result on multicolored simplices
- The jump number of suborders of the power set order
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- The order dimension of two levels of the Boolean lattices
- Radon numbers and the fractional Helly theorem
- An extremal problem for sets with applications to graph theory
- Hyperconnectivity of graphs
- Title not available (Why is that?)
- Combinatorial generalizations of Jung's theorem
- A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane
- A note on the colorful fractional Helly theorem
- Large cliques in hypergraphs with forbidden substructures
- A Helly type theorem for hypersurfaces
- Bollobás-type theorems for hemi-bundled two families
- Matchings and covers in hypergraphs
- A note on induced cycles in Kneser graphs
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Fractional Helly theorem for Cartesian products of convex sets
- A fractional Helly theorem for boxes
- An upper-bound theorem for families of convex sets
- Density results for uniform families
- Intersection properties of boxes. II: Extremal families
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Bounding the piercing number
- Helly’s theorem: New variations and applications
- Intersection properties of boxes. I: An upper-bound theorem
- Turán and Ramsey properties of subcube intersection graphs
- Set systems related to a house allocation problem
- Obstructions to convexity in neural codes
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Transversal numbers for hypergraphs arising in geometry
- Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets
- Solution of an extremal problem for sets using resultants of polynomials
- On the kernel of intersecting families
- Combinatorial properties of nonarchimedean convex sets
- Berge's theorem, fractional Helly, and art galleries
- Quantitative fractional Helly and \((p,q)\)-theorems
- Intersection patterns of planar sets
- Bounding multiplicity by shifts in the Taylor resolution
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- Variations on the Bollobás set-pair theorem
- On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
- Helly-type problems
- Helly-type theorems in property testing
- Circulant almost cross intersecting families
- An asymptotic resolution of a conjecture of Szemerédi and Petruska
- The Upper‐Bound Theorem for Families of Boxes in ℝ d
- Title not available (Why is that?)
- Interview with Gil Kalai
- Collapsibility of simplicial complexes of hypergraphs
- Intersection Disjunctions for Reverse Convex Sets
- On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs
- Nerves, minors, and piercing numbers
- Collapsibility of non-cover complexes of graphs
This page was built for publication: Intersection patterns of convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762464)
