Invitation to intersection problems for finite sets
type: Item
instance of: scholarly article
title: Invitation to intersection problems for finite sets
zbMATH Open document ID: 1343.05153
author: Peter Frankl
author: Norihide Tokushige
published in: Journal of Combinatorial Theory. Series A
publication date: 2016-08-18T00:00:00Z
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6617988
zbMATH Keywords: extremal set theory
zbMATH Keywords: intersection problems
zbMATH Keywords: shadow and shifting
zbMATH Keywords: independence number
zbMATH Keywords: matching number
zbMATH Keywords: covering number
zbMATH Keywords: L-systems
zbMATH Keywords: semidefinite programming
MaRDI profile type: Publication
full work available at URL: j.jcta.2016.06.017
OpenAlex ID: W2516050763
cites work: The complete nontrivial-intersection theorem for systems of finite sets
cites work: The complete intersection theorem for systems of finite sets
cites work: A pushing-pulling method: New proofs of intersection theorems
cites work: Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
cites work: Q2754178
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Intersection theorems and a lemma of Kleitman
cites work: Set systems with restricted intersections modulo prime powers
cites work: Q4945051
cites work: A Hilton-Milner theorem for vector spaces
cites work: Q3726125
cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
cites work: Intersecting families of sets and permutations: a survey
cites work: The maximum product of sizes of cross-$t$-intersecting uniform families
cites work: The maximum product of weights of cross-intersecting families
cites work: A finite set covering theorem
cites work: Intersecting families of permutations
cites work: Improved bounds on families under \(k\)-wise set-intersection constraints
cites work: Families of Sets with Intersecting Clusters
cites work: Shadows and intersections in vector spaces
cites work: An Extremal Set-Intersection Theorem
cites work: Removal and stability for Erdős-Ko-Rado
cites work: A simple proof of the Kruskal-Katona theorem
cites work: Sets of finite sets satisfying union conditions
cites work: The Number of Values of a Boolean Function
cites work: Q5707657
cites work: Intersection Properties of Systems of Finite Sets
cites work: Intersecting Families are Essentially Contained in Juntas
cites work: Q3792687
cites work: Forbidding just one intersection, for permutations
cites work: Triangle-intersecting families of graphs
cites work: Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
cites work: Q4338928
cites work: Q5510578
cites work: On the combinatorial problems which I would most like to see solved
cites work: Q3760478
cites work: On maximal paths and circuits of graphs
cites work: Extremal problems among subsets of a set
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Q4074927
cites work: Probabilities for Intersecting Systems and Random Subsets of Finite Sets
cites work: The proof of a conjecture of G. O. H. Katona
cites work: On Sperner families satisfying an additional condition
cites work: Q4871772
cites work: Q4184835
cites work: On intersecting families of finite sets
cites work: On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
cites work: Constructing Finite Sets With Given Intersections
cites work: All rationals occur as exponents
cites work: Q3770569
cites work: A lower bound on the size of a complex generated by an antichain
cites work: Multiply-intersecting families
cites work: Shadows and shifting
cites work: On the maximum number of edges in a hypergraph with given matching number
cites work: Improved bounds for Erdős' matching conjecture

Invitation to intersection problems for finite sets (cites work)
cites work: A new generalization of the Erdős-Ko-Rado theorem

Invitation to intersection problems for finite sets (cites work)
cites work: On hypergraphs without two edges intersecting in a given number of vertices

Invitation to intersection problems for finite sets (cites work)
cites work: Forbidding just one intersection

Invitation to intersection problems for finite sets (cites work)
cites work: Exact solution of some Turán-type problems

Invitation to intersection problems for finite sets (cites work)
cites work: Beyond the Erdős-Ko-Rado theorem

Invitation to intersection problems for finite sets (cites work)
cites work: A new short proof of the EKR theorem

Invitation to intersection problems for finite sets (cites work)
cites work: On matchings in hypergraphs

Invitation to intersection problems for finite sets (cites work)
cites work: An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families

Invitation to intersection problems for finite sets (cites work)
cites work: Minimum shadows in uniform hypergraphs and a generalization of the Takagi function

Invitation to intersection problems for finite sets (cites work)
cites work: Uniform intersecting families with covering number four

Invitation to intersection problems for finite sets (cites work)
cites work: Covers in uniform intersecting families and a counterexample to a conjecture of Lovász

Invitation to intersection problems for finite sets (cites work)
cites work: Exponents of uniform \(L\)-systems

Invitation to intersection problems for finite sets (cites work)
cites work: Near perfect coverings in graphs and hypergraphs

Invitation to intersection problems for finite sets (cites work)
cites work: Forbidden Intersections

Invitation to intersection problems for finite sets (cites work)
cites work: Some best possible inequalities concerning cross-intersecting families

Invitation to intersection problems for finite sets (cites work)
cites work: On r-Cross Intersecting Families of Sets

Invitation to intersection problems for finite sets (cites work)
cites work: Uniform eventown problems

Invitation to intersection problems for finite sets (cites work)
cites work: Intersection theorems with geometric consequences

Invitation to intersection problems for finite sets (cites work)
cites work: The Erdős-Ko-Rado theorem for vector spaces

Invitation to intersection problems for finite sets (cites work)
cites work: On the measure of intersecting families, uniqueness and stability

Invitation to intersection problems for finite sets (cites work)
cites work: Covers in 5-uniform intersecting families with covering number three

Invitation to intersection problems for finite sets (cites work)
cites work: On finite set-systems whose every intersection is a kernel of a star

Invitation to intersection problems for finite sets (cites work)
cites work: Matchings and covers in hypergraphs

Invitation to intersection problems for finite sets (cites work)
cites work: Q3348932

Invitation to intersection problems for finite sets (cites work)
cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches

Invitation to intersection problems for finite sets (cites work)
cites work: Q2716030

Invitation to intersection problems for finite sets (cites work)
cites work: Q4196436

Invitation to intersection problems for finite sets (cites work)
cites work: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs

Invitation to intersection problems for finite sets (cites work)
cites work: Optimal numberings and isoperimetric problems on graphs

Invitation to intersection problems for finite sets (cites work)
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Invitation to intersection problems for finite sets (cites work)
cites work: The size of a hypergraph and its matching number

Invitation to intersection problems for finite sets (cites work)
cites work: A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials

Invitation to intersection problems for finite sets (cites work)
cites work: Q4255576

Invitation to intersection problems for finite sets (cites work)
cites work: On a Problem of Erdos and Lovasz. II: n(r) = O(r)

Invitation to intersection problems for finite sets (cites work)
cites work: Intersection theorems for systems of finite sets

Invitation to intersection problems for finite sets (cites work)
cites work: Q4071752

Invitation to intersection problems for finite sets (cites work)
cites work: Q4052170

Invitation to intersection problems for finite sets (cites work)
cites work: Shadows and intersections: Stability and new proofs

Invitation to intersection problems for finite sets (cites work)
cites work: Q3089368

Invitation to intersection problems for finite sets (cites work)
cites work: Frankl-Rödl-type theorems for codes and permutations

Invitation to intersection problems for finite sets (cites work)
cites work: Families of Non-disjoint subsets

Invitation to intersection problems for finite sets (cites work)
cites work: On subsets containing a family of non-commensurable subsets of a finite set

Invitation to intersection problems for finite sets (cites work)
cites work: Maximal number of subsets of a finite set No k of which are pairwise disjoint

Invitation to intersection problems for finite sets (cites work)
cites work: A note on the stability number of an orthogonality graph

Invitation to intersection problems for finite sets (cites work)
cites work: Q5726070

Invitation to intersection problems for finite sets (cites work)
cites work: Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers

Invitation to intersection problems for finite sets (cites work)
cites work: Stable sets of maximal size in Kneser-type graphs

Invitation to intersection problems for finite sets (cites work)
cites work: Q3201059

Invitation to intersection problems for finite sets (cites work)
cites work: Non \(t\)-intersecting families of linear spaces over \(GF(q)\)

Invitation to intersection problems for finite sets (cites work)
cites work: Q4180391

Invitation to intersection problems for finite sets (cites work)
cites work: On the Shannon capacity of a graph

Invitation to intersection problems for finite sets (cites work)
cites work: Differences of Sets and A Problem of Graham

Invitation to intersection problems for finite sets (cites work)
cites work: A generalization of the Katona theorem for cross t-intersecting families

Invitation to intersection problems for finite sets (cites work)
cites work: An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)

Invitation to intersection problems for finite sets (cites work)
cites work: Erdős--Ko--Rado for three sets

Invitation to intersection problems for finite sets (cites work)
cites work: Specified intersections

Invitation to intersection problems for finite sets (cites work)
cites work: Proof of a conjecture of Erdős on triangles in set-systems

Invitation to intersection problems for finite sets (cites work)
cites work: Cross-intersecting families of vectors

Invitation to intersection problems for finite sets (cites work)
cites work: Asymptotic behavior of the chromatic index for hypergraphs

Invitation to intersection problems for finite sets (cites work)
cites work: On t-designs

Invitation to intersection problems for finite sets (cites work)
cites work: On a packing and covering problem

Invitation to intersection problems for finite sets (cites work)
cites work: A note on a conjecture by Füredi

Invitation to intersection problems for finite sets (cites work)
cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming

Invitation to intersection problems for finite sets (cites work)
cites work: On incomparable collections of sets

Invitation to intersection problems for finite sets (cites work)
cites work: The maximum size of intersecting and union families of sets

Invitation to intersection problems for finite sets (cites work)
cites work: A sharp bound for the number of sets that pairwise intersect at \(k\) positive values

Invitation to intersection problems for finite sets (cites work)
cites work: A cross-intersection theorem for vector spaces based on semidefinite programming

Invitation to intersection problems for finite sets (cites work)
cites work: A semidefinite programming approach to a cross-intersection problem with measures

Invitation to intersection problems for finite sets (cites work)
cites work: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs

Invitation to intersection problems for finite sets (cites work)
cites work: Antipodal sets in oriented real Grassmann manifolds

Invitation to intersection problems for finite sets (cites work)
cites work: Estimates of antipodal sets in oriented real Grassmann manifolds

Invitation to intersection problems for finite sets (cites work)
cites work: Semidefinite optimization

Invitation to intersection problems for finite sets (cites work)
cites work: An \(L\)-system on the small Witt design

Invitation to intersection problems for finite sets (cites work)
cites work: Q3509408

Invitation to intersection problems for finite sets (cites work)
cites work: The eigenvalue method for cross \(t\)-intersecting families

Invitation to intersection problems for finite sets (cites work)
cites work: Cross \(t\)-intersecting integer sequences from weighted Erdős-Ko-Rado

Invitation to intersection problems for finite sets (cites work)
cites work: On systems of finite sets with constraints on their unions and intersections

Invitation to intersection problems for finite sets (cites work)
cites work: Nontrivial independent sets of bipartite graphs and cross-intersecting families

Invitation to intersection problems for finite sets (cites work)
cites work: The exact bound in the Erdős-Ko-Rado theorem

Invitation to intersection problems for finite sets (DOI)
DOI: 10.1016/J.JCTA.2016.06.017