Finite projective spaces and intersecting hypergraphs
Consider \({\mathcal F}^ a \)family of k-subsets of an n-set X and \(c\in [0,1]\). If any t members of \({\mathcal F}\) have a common element (t\(\geq 2)\) and every element of X is contained in at most c. \(| {\mathcal F}|\) members of \({\mathcal F}\), for \(c=(q^{t-1}+...+q+1)/(q\quad t+...+q+1),\) where q is a prime power and n is sufficiently large \((n>n(k,c))\), then \[ \max | {\mathcal F}| =\left( \begin{matrix} n-q\quad t-...-1\\ k-q^{t- 1}-...-1\end{matrix} \right).\quad (q^{t+...+q+1})\text{ (Theorem 2.9).} \] The lower bound is given in the case that Y is a (q \(t+...+q+1)\)-subset of \(X,H_ 1,H_ 2,...,H_{| X|}\) are some hyperplanes of the t-dimensional projective space of order q on Y, \({\mathcal F}\) is formed by the k-subsets which intersect Y in a hyperplane.
- An intersection problem with 6 extremes
- Blocking Sets in Finite Projective Planes
- Critical hypergraphs and interesting set-pair systems
- Families of finite sets satisfying a union condition
- Generalizations of theorems of Katona and Milner
- scientific article; zbMATH DE number 3875317 (Why is no real title available?)
- scientific article; zbMATH DE number 3204639 (Why is no real title available?)
- scientific article; zbMATH DE number 3400807 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Maximum degree and fractional matchings in uniform hypergraphs
- Non-trivial intersecting families
- On a conjecture of milner on k-graphs with non-disjoint edges
- On intersecting families of finite sets
- On Sperner families satisfying an additional condition
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- t-expansive and t-wise intersecting hypergraphs
- t-expansive and t-wise intersecting hypergraphs
- On the kernel of intersecting families
- Symmetric designs as the solution of an extremal problem in combinatorial set theory
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- A generalization of the Katona theorem for cross t-intersecting families
- \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
- Covering \(t\)-element sets by partitions
- A general framework for discovering and proving theorems of the Erdős- Ko-Rado type
- On a problem of Erdős and Lovász: Random lines in a projective plane
- Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
- Intersecting designs from linear programming and graphs of diameter two
- On intersecting hypergraphs
- A Meshalkin theorem for projective geometries
- Domination in intersecting hypergraphs
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- Matchings and covers in hypergraphs
- An Erdős-Ko-Rado theorem for regular intersecting families of octads
- Projective dimension of hypergraphs
- Ryser's conjecture for \(t\)-intersecting hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- A note on kernels of intersecting families
- Regular intersecting families
- Hilton-Milner results in projective and affine spaces
- scientific article; zbMATH DE number 3823793 (Why is no real title available?)
- Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
- On sets with few intersection numbers in finite projective and affine spaces
- Matching criticality in intersecting hypergraphs
- scientific article; zbMATH DE number 969103 (Why is no real title available?)
- Separating subsets from their images
- Geometrical solution of an intersection problem for two hypergraphs
- Covering pairs by q^ 2+q+1 sets
- Covering the complete graph by partitions
- On the measure of intersecting families, uniqueness and stability
This page was built for publication: Finite projective spaces and intersecting hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101456)
