Invitation to intersection problems for finite sets

DOI10.1016/j.jcta.2016.06.017zbMath1343.05153OpenAlexW2516050763MaRDI QIDQ739389

Peter Frankl, Norihide Tokushige

Publication date: 18 August 2016

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2016.06.017

zbMATH Keywords

semidefinite programmingindependence numberextremal set theorymatching numbercovering numberL-systemsintersection problemsshadow and shifting

Mathematics Subject Classification ID

Semidefinite programming (90C22) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The maximum product of sizes of cross-intersecting families, Families with no perfect matchings, The maximum sum of sizes of cross-intersecting families of subsets of a set, The spectral radii of intersecting uniform hypergraphs, Cross-intersecting subfamilies of levels of hereditary families, The intersection spectrum of 3‐chromatic intersecting hypergraphs, A degree version of the Hilton-Milner theorem, Cross-intersecting non-empty uniform subfamilies of hereditary families, On t-Intersecting Hypergraphs with Minimum Positive Codegrees, Uniform hypergraphs under certain intersection constraints between hyperedges, The maximum product of weights of cross-intersecting families, Forbidden intersections for codes, Extremal problems in hypergraph colourings, Triangles in \(r\)-wise \(t\)-intersecting families, Intersecting families, cross-intersecting families, and a proof of a conjecture of Feghali, Johnson and Thomas, A structure theorem for almost low-degree functions on the slice, A Note on Large H-Intersecting Families, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, New results on simplex-clusters in set systems, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, A sharp bound for the product of weights of cross-intersecting families, New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems, A generalization of Erdős' matching conjecture, The Hilton-Milner theorem for attenuated spaces, On set systems without a simplex-cluster and the junta method, Disjoint pairs in set systems with restricted intersection, A short proof of Talbot's theorem for intersecting separated sets, VC dimension and a union theorem for set systems, Degree versions of theorems on intersecting families via stability, \(r\)-cross \(t\)-intersecting families for vector spaces, Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree, The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem

Cites Work

• The Number of Values of a Boolean Function
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• On the Shannon capacity of a graph
• Intersection Properties of Systems of Finite Sets
• On a Problem of Erdos and Lovasz. II: n(r) = O(r)
• On incomparable collections of sets
• Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
• Intersecting families of sets and permutations: a survey
• Estimates of antipodal sets in oriented real Grassmann manifolds
• Intersection theorems for systems of finite sets
• A cross-intersection theorem for vector spaces based on semidefinite programming
• Families of Non-disjoint subsets
• On subsets containing a family of non-commensurable subsets of a finite set
• Optimal numberings and isoperimetric problems on graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Differences of Sets and A Problem of Graham
• A finite set covering theorem
• Maximal number of subsets of a finite set No k of which are pairwise disjoint
• Intersecting families of permutations
• A new generalization of the Erdős-Ko-Rado theorem
• On intersecting families of finite sets
• On intersecting families of finite sets
• Intersecting families of permutations
• A pushing-pulling method: New proofs of intersection theorems
• Set systems with restricted intersections modulo prime powers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The eigenvalue method for cross \(t\)-intersecting families
• Improved bounds for Erdős' matching conjecture
• A new short proof of the EKR theorem
• On matchings in hypergraphs
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
• A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials
• Uniform eventown problems
• On the maximum number of edges in a hypergraph with given matching number
• The maximum size of intersecting and union families of sets
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• On hypergraphs without two edges intersecting in a given number of vertices
• On finite set-systems whose every intersection is a kernel of a star
• Asymptotic behavior of the chromatic index for hypergraphs
• Shadows and intersections: Stability and new proofs
• On the measure of intersecting families, uniqueness and stability
• A Hilton-Milner theorem for vector spaces
• On a packing and covering problem
• Forbidding just one intersection
• All rationals occur as exponents
• The Erdős-Ko-Rado theorem for vector spaces
• Near perfect coverings in graphs and hypergraphs
• Exact solution of some Turán-type problems
• A generalization of the Katona theorem for cross t-intersecting families
• A lower bound on the size of a complex generated by an antichain
• On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• On the combinatorial problems which I would most like to see solved
• Intersection theorems with geometric consequences
• Beyond the Erdős-Ko-Rado theorem
• Shadows and shifting
• Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• Multiply-intersecting families
• Some best possible inequalities concerning cross-intersecting families
• The proof of a conjecture of G. O. H. Katona
• On Sperner families satisfying an additional condition
• On t-designs
• Intersection theorems and a lemma of Kleitman
• On systems of finite sets with constraints on their unions and intersections
• Minimum shadows in uniform hypergraphs and a generalization of the Takagi function
• Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
• A semidefinite programming approach to a cross-intersection problem with measures
• Nontrivial independent sets of bipartite graphs and cross-intersecting families
• Matchings and covers in hypergraphs
• Stable sets of maximal size in Kneser-type graphs
• Extremal problems among subsets of a set
• A simple proof of the Kruskal-Katona theorem
• A sharp bound for the number of sets that pairwise intersect at \(k\) positive values
• Uniform intersecting families with covering number four
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Exponents of uniform \(L\)-systems
• The complete nontrivial-intersection theorem for systems of finite sets
• Shadows and intersections in vector spaces
• Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
• Cross-intersecting families of vectors
• Proof of a conjecture of Erdős on triangles in set-systems
• An \(L\)-system on the small Witt design
• Erdős--Ko--Rado for three sets
• Improved bounds on families under \(k\)-wise set-intersection constraints
• Triangle-intersecting families of graphs
• Forbidding just one intersection, for permutations
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• A note on a conjecture by Füredi
• A note on the stability number of an orthogonality graph
• Removal and Stability for Erdös--Ko--Rado
• Frankl-Rödl-type theorems for codes and permutations
• Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado
• ANTIPODAL SETS IN ORIENTED REAL GRASSMANN MANIFOLDS
• Specified intersections
• The Size of a Hypergraph and its Matching Number
• The maximum product of sizes of cross-$t$-intersecting uniform families
• The maximum product of weights of cross-intersecting families
• On r-Cross Intersecting Families of Sets
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Semidefinite optimization
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Intersecting Families are Essentially Contained in Juntas
• Families of Sets with Intersecting Clusters
• Constructing Finite Sets With Given Intersections
• Probabilities for Intersecting Systems and Random Subsets of Finite Sets
• Forbidden Intersections
• Sets of finite sets satisfying union conditions
• An Extremal Set-Intersection Theorem