Geometrical solution of an intersection problem for two hypergraphs
The author generalizes the following known theorem. If \(A_ 1,...,A_ m\) are a-element and \(B_ 1,...,B_ m\) are b-element sets with \(A_ i\cap B_ j=\emptyset\) iff \(i=j\) then \(m\leq \left( \begin{matrix} a+b\\ a\end{matrix} \right).\) He proves two generalizations below. Let \(A_ 1,...,A_ m\) be a-element and \(B_ 1,...,B_ m\) be b-element sets and \(t\leq\min (a,b).\) If \(| A_ i\cap B_ j|\leq t\) iff \(i=j\) then \(m\leq \left( \begin{matrix} a+b-2t\\ a-t\end{matrix} \right).\) The second result states that if \(A_ 1,...,A_ m\) are a-dimensional and \(B_ 1,...,B_ m\) are b-dimensional subspaces of \(R^ n\), and \(t\leq\min (a,b)\) then \(m\leq \left( \begin{matrix} a+b-2t\\ a-t\end{matrix} \right)\) provided \(\dim (A_ i\cap B_ j)\leq t\) iff \(i=j\).
- A Problem in Graph Theory
- An extremal problem for two families of sets
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3722680 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 3613058 (Why is no real title available?)
- scientific article; zbMATH DE number 3275275 (Why is no real title available?)
- scientific article; zbMATH DE number 3370377 (Why is no real title available?)
- On generalized graphs
- On two Combinatorial Problems Arising from Automata Theory
- Solution of a problem of A. Ehrenfeucht and J. Mycielski
- The orchard problem
- Intersection theorems for vector spaces
- Finite projective spaces and intersecting hypergraphs
- On the kernel of intersecting families
- The intersection theorem for direct products
- Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
- On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families
- Matchings and covers in hypergraphs
- A Helly type theorem for hypersurfaces
- A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
- On two set-systems with restricted cross-intersections
- Intersection sizes of linear subspaces with the hypercube
- Flattening rank and its combinatorial applications
- A generalization of the Bollobás set pairs inequality
- Bollobás-type theorems for hemi-bundled two families
- Set systems related to a house allocation problem
- Intersecting families of discrete structures are typically trivial
- A note on kernels of intersecting families
- Collapsibility of simplicial complexes of hypergraphs
- Intersection theorems under dimension constraints
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Difference graphs
- Problems and results on 1-cross-intersecting set pair systems
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
- Variations on the Bollobás set-pair theorem
- \(K_r\)-saturated graphs and the two families theorem
- Some new Bollobás-type inequalities
- On Bollobás-type theorems of d-tuples
- Variations on Bollobás systems of d-partitions
- Properties of intersecting families of ordered sets
This page was built for publication: Geometrical solution of an intersection problem for two hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798334)
