INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- Set systems with \(\mathcal L\)-intersections modulo a prime number
- The covering radius of extreme binary 2-surjective codes
- The unbalance of set systems
- A generalization of Talbot's theorem about King Arthur and his knights of the round table
- On t-intersecting families of signed sets and permutations
- Set systems with union and intersection constraints
- Commutative association schemes
- The Erdős-Ko-Rado properties of various graphs containing singletons
- Families intersecting on an interval
- A short proof of a cross-intersection theorem of Hilton
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
- Fractional set systems with few disjoint pairs
- A generalization of the Erdős-Ko-Rado theorem
- On the density of sets of vectors
- On qualitatively independent partitions and related problems
- An extremal theorem on divisors of a number
- An intersection-union theorem for integer sequences
- Extremal problems concerning Kneser-graphs
- Forbidding just one intersection
- Intersection theorems for vector spaces
- Extremal hypergraph problems and convex hulls
- Non-trivial intersecting families
- Hamiltonian uniform subset graphs
- Families of finite sets in which no set is covered by the union of \(r\) others
- A generalization of a theorem of Kruskal
- Polytopes determined by hypergraph classes
- The Erdős-Ko-Rado theorem for vector spaces
- Inequalities for two set systems with prescribed intersections
- The maximum number of balancing sets
- On the representing number of intersecting families
- The maximum number of edges in a 3-graph not containing a given star
- An Erdős-Ko-Rado theorem for integer sequences of given rank
- On squashed designs
- Families of finite sets with minimum shadows
- Finite projective spaces and intersecting hypergraphs
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- Some intersection theorems on two-valued functions
- Some intersection theorems for ordered sets and graphs
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Exact solution of some Turán-type problems
- Intersection theorems in permutation groups
- The complexity of multicolouring
- Bounding one-way differences
- An extended Euler-Poincaré theorem
- Finite algebras with large free spectra
- A lower bound on the size of a complex generated by an antichain
- Some results on Sperner families
- On counting Sperner families
- Simple hypergraphs with maximal number of adjacent pairs of edges
- On maximal antichains consisting of sets and their complements
- Extremal problems and coverings of the space
- On set systems determined by intersections
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- On Sperner families in which no k sets have an empty intersection. III
- An extension of the Erdoes, Ko, Rado theorem to t-designs
- Projective (2n,n,,1)-designs
- Beyond the Erdős-Ko-Rado theorem
- Shadows and shifting
- Superextensions and the depth of median graphs
- Partitioning a power set into union-free classes
- Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
- Multiply-intersecting families
- Order and disorder in algebraic combinatorics
- Some best possible inequalities concerning cross-intersecting families
- A general framework for discovering and proving theorems of the Erdős- Ko-Rado type
- Some intersection theorems
- Cycle-connected graphs
- n-tuple colorings and associated graphs
- Nombres de coloration de l'hypergraphe h-parti complet
- The proof of a conjecture of G. O. H. Katona
- Interpolation of functions over a measure space and conjectures about memory
- Intersection theorems for systems of finite vector spaces
- Families of intersecting finite vector spaces
- Extremal properties of collections of subsets containing no two sets and their union
- On the maximum number of permutations with given maximal or minimal distance
- Extensions of the Erdős-Ko-Rado theorem and a statistical application
- Contributions to the geometry of Hamming spaces
- Collective rationality versus distribution of power for binary social choice functions
- Extremal theorems on divisors of a number
- Families of finite sets satisfying a union condition
- On systems of finite sets with constraints on their unions and intersections
- An extremal problem among subsets of a set
- The diametric theorem in Hamming spaces---optimal anticodes
- A homological approach to two problems on finite sets
- Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
- Erdős-Ko-Rado-type results over J_q(n,d),H_q(n,d) and their designs
- On conjectures of Berge and Chvátal
- Weight functions on the Kneser graph and the solution of an intersection problem of Sali
- Non-empty cross-2-intersecting families of subsets
- The Erdős-Ko-Rado theorem for small families
- Largest size and union of Helly families
- Density results for uniform families
- The order dimension of two levels of the Boolean lattices
- Problems and results in discrete mathematics
- Extremal problems for finite sets and convex hulls---a survey
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
- Counterexample to the Frankl-Pach conjecture for uniform, dense families
- An Erdős-Ko-Rado theorem for signed sets
This page was built for publication: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3281090)