Forbidden Intersections
From MaRDI portal
Publication:3751579
DOI10.2307/2000598zbMath0611.05002OpenAlexW4237041405MaRDI QIDQ3751579
Publication date: 1987
Full work available at URL: https://doi.org/10.2307/2000598
Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65) Permutations, words, matrices (05A05)
Related Items
On the chromatic number of a space with a forbidden regular simplex, On chromatic numbers of close-to-Kneser distance graphs, Lower bounds for the chromatic numbers of distance graphs with large girth, Strong Ramsey properties of simplices, Conic formulations of graph homomorphisms, Codes with given distances, Turán numbers of sunflowers, Multicolour Sunflowers, On a restricted cross-intersection problem, On chromatic numbers of nearly Kneser distance graphs, A note on the stability number of an orthogonality graph, Finite Euclidean Ramsey theory, Intersection statements for systems of sets, On the size of set systems on \([n\) not containing weak \((r,\Delta)\)-systems], Edge-Ramsey theory, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, A generalization of the Katona theorem for cross t-intersecting families, A tale of stars and cliques, Sabidussi versus Hedetniemi for three variations of the chromatic number, Improvements of the Frankl-Rödl theorem and geometric consequences, Deterministic quantum non-locality and graph colorings, Bisecting and \(D\)-secting families for set systems, From Quantum Query Complexity to State Complexity, A recursive Lovász theta number for simplex-avoiding sets, Binary scalar products, The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances, On the number of edges of a uniform hypergraph with a range of allowed intersections, On a Frankl-Wilson theorem, On a Frankl-Rödl theorem and its geometric corollaries, Unnamed Item, Forbidden intersections for codes, Intersection theorems for \((- 1, 0, 1)\)-vectors, Robust Factorizations and Colorings of Tensor Graphs, System of unbiased representatives for a collection of bicolorings, Unnamed Item, Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits, Generalizations of the distributed Deutsch–Jozsa promise problem, On the Frankl–Rödl theorem, Hypercontractivity of Spherical Averages in Hamming Space, Monochromatic equilateral triangles in the unit distance graph, On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem, Lovász, Vectors, Graphs and Codes, Almost-Fisher families, Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections, Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Unavoidable hypergraphs, The chromatic number of space with forbidden regular simplex, Set families with a forbidden pattern, On cross-intersecting families, Sets of vectors with many orthogonal pairs, Fractional \(L\)-intersecting families, Problems from CGCS Luminy, May 2007, Disjoint pairs in set systems with restricted intersection, A Partition Property of Simplices in Euclidean Space, Lower Bounds for Syntactically Multilinear Algebraic Branching Programs, Uniformly cross intersecting families, Unnamed Item, Exponentially Ramsey sets, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, Convex Relaxations and Integrality Gaps, Invitation to intersection problems for finite sets, \(d\)-Galvin families, New Tools for Graph Coloring, Streaming Algorithms with One-Sided Estimation, Unnamed Item, Hypercontractive inequalities via SOS, and the Frankl--Rödl graph, Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits, Improved Frankl-Rödl theorem and some of its geometric consequences, Frankl-Rödl-type theorems for codes and permutations, Lower bounds for measurable chromatic numbers, Simplices and regular polygonal tori in Euclidean Ramsey theory, Quantum communication and complexity., Specified intersections, A counterexample to Borsuk’s conjecture, Forbidding intersection patterns between layers of the cube, Quantum homomorphisms, New lower bounds for the chromatic number of a space with forbidden isosceles triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The exact bound in the Erdős-Ko-Rado theorem
- On hypergraphs without two edges intersecting in a given number of vertices
- A two-family extremal problem in Hamming space
- On a packing and covering problem
- Forbidding just one intersection
- An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
- Hadamard graphs. I
- Codes with given distances
- On the combinatorial problems which I would most like to see solved
- Intersection theorems with geometric consequences
- Contributions to the geometry of Hamming spaces
- Combinatorial properties of systems of sets
- Euclidean Ramsey theorems. I
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- All Triangles are Ramsey
- Generalizations of theorems of Katona and Milner
- Four fundamental parameters of a code and their combinatorial significance
- Intersection theorems for systems of finite sets
- Optimal numberings and isoperimetric problems on graphs
- The realization of distances within sets in Euclidean space
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
