Intersection patterns of convex sets
From MaRDI portal
Sind in \(R^ d\) die konvexen Mengen \(K_ 1,...,K_ n\) gegeben und bezeichnet man für \(0\leq i<n\) mit \(f_ i\) die Anzahl der Untermengen \(S\subset \{1,...,n\}\) mit der Kardinalzahl \(i+1\), so daß \(\quad \cap \{K_ i:i\in S\}\neq \emptyset,\) so zeigt der Verfasser, daß, wenn \(f_{d+r}=0\) für ein bestimmtes \(r>0\) gilt, \(f_{k-1}\leq \sum^{d}_{i=0}\left( \begin{matrix} r\\ k-i\end{matrix} \right)\left( \begin{matrix} n-r\\ i\end{matrix} \right)\) für alle \(k>0\) ist.
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
Cites work
- A Problem of Geometry in R n
- A simple proof of the upper bound theorem
- A Turan type problem for interval graphs
- An extremal problem for two families of sets
- Boxes in Rn —A ‘Fractional’ Theorem
- 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
- scientific article; zbMATH DE number 3530031 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- Hyperconnectivity of graphs
- Incidence Matrices of Subsets—A Rank Formula
- Sur la forme des espaces topologiques et sur les points fixes des représentations
- Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.
Cited in
(85)- 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
- A simple proof of the upper bound theorem
- An upper-bound theorem for families of convex sets
- Hyperconnectivity of graphs
- Inequalities for two set systems with prescribed intersections
- On the kernel of intersecting families
- Intersection properties of boxes. I: An upper-bound theorem
- A note on induced cycles in Kneser graphs
- Intersection properties of boxes. II: Extremal families
- Saturated r-uniform hypergraphs
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Density results for uniform families
- The order dimension of two levels of the Boolean lattices
- A Tverberg-type result on multicolored simplices
- On piercing numbers of families satisfying the \((p,q)_{r}\) property
- Improved bounds on the Hadwiger-Debrunner numbers
- Intersection patterns of linear subspaces with the hypercube
- Matchings and covers in hypergraphs
- A Helly type theorem for hypersurfaces
- Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets
- Transversal numbers for hypergraphs arising in geometry
- A fractional Helly theorem for convex lattice sets
- Bounding the piercing number
- Combinatorial generalizations of Jung's theorem
- Radon numbers and the fractional Helly theorem
- Quantitative combinatorial geometry for concave functions
- Bollobás-type theorems for hemi-bundled two families
- Leray numbers of complexes of graphs with bounded matching number
- Size and structure of large \((s,t)\)-union intersecting families
- Set systems related to a house allocation problem
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Intersection patterns of planar sets
- Large cliques in hypergraphs with forbidden substructures
- Quantitative fractional Helly and \((p,q)\)-theorems
- Collapsibility of non-cover complexes of graphs
- Collapsibility of simplicial complexes of hypergraphs
- On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
- Berge's theorem, fractional Helly, and art galleries
- Partitions of a polytope and mappings of a point set to facets
- Common transversals in the plane: The fractional perspective
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Applications of graph containers in the Boolean lattice
- Helly’s theorem: New variations and applications
- A note on the colorful fractional Helly theorem
- The Upper‐Bound Theorem for Families of Boxes in ℝ d
- Piercing convex sets
- scientific article; zbMATH DE number 1354889 (Why is no real title available?)
- Helly-type theorems in property testing
- A fractional Helly theorem for boxes
- Turán and Ramsey properties of subcube intersection graphs
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Obstructions to convexity in neural codes
- Circulant almost cross intersecting families
- Intersection Disjunctions for Reverse Convex Sets
- scientific article; zbMATH DE number 5679794 (Why is no real title available?)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Algorithm Theory - SWAT 2004
- Nerves, minors, and piercing numbers
- What makes a neural code convex?
- The jump number of suborders of the power set order
- Helly-type problems
- Combinatorial properties of nonarchimedean convex sets
- An asymptotic resolution of a conjecture of Szemerédi and Petruska
- Problems and results on 1-cross-intersecting set pair systems
- Interview with Gil Kalai
- Fractional Helly theorem for Cartesian products of convex sets
- On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs
- Variations on the Bollobás set-pair theorem
- Bounded degrees and prescribed distances in graphs
- Variations on Bollobás systems of d-partitions
- Bollobás set pair inequalities for compositions
- A note on the maximum size of the ground set of skew Bollobás systems
- Extensions of discrete Helly theorems for boxes
- Piercing intersecting convex sets
- Optimal bounds for the colorful fractional Helly theorem
- A stepping-up lemma for topological set systems
- Colorful fractional Helly theorem via weak saturation
- Extremal G-free induced subgraphs of Kneser graphs
- Enumeration of interval graphs and d-representable complexes
- Intersection patterns in spaces with a forbidden homological minor
- The quantitative fractional Helly theorem
- A variant of the Hadwiger-Debrunner (p,q)-problem in the plane
- Solution of an extremal problem for sets using resultants of polynomials
- Bounding multiplicity by shifts in the Taylor resolution
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)
