Forbidden Intersections
From MaRDI portal
Publication:3751579
DOI10.2307/2000598zbMATH Open0611.05002OpenAlexW4237041405MaRDI QIDQ3751579FDOQ3751579
Authors: Peter Frankl, Vojtěch Rödl 
Publication date: 1987
Full work available at URL: https://doi.org/10.2307/2000598
Recommendations
Permutations, words, matrices (05A05) Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65)
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a packing and covering problem
- Forbidding just one intersection
- On the combinatorial problems which I would most like to see solved
- Intersection theorems with geometric consequences
- Contributions to the geometry of Hamming spaces
- The realization of distances within sets in Euclidean space
- Euclidean Ramsey theorems. I
- Title not available (Why is that?)
- Intersection theorems for systems of finite sets
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- The exact bound in the Erdős-Ko-Rado theorem
- Optimal numberings and isoperimetric problems on graphs
- Erdös–Ko–Rado Theorem—22 Years Later
- On hypergraphs without two edges intersecting in a given number of vertices
- Combinatorial properties of systems of sets
- Four fundamental parameters of a code and their combinatorial significance
- All Triangles are Ramsey
- Hadamard graphs. I
- Title not available (Why is that?)
- Codes with given distances
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- A two-family extremal problem in Hamming space
- An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalizations of theorems of Katona and Milner
Cited In (89)
- Unavoidable hypergraphs
- Quantum homomorphisms
- Conic formulations of graph homomorphisms
- On chromatic numbers of close-to-Kneser distance graphs
- A generalization of the Katona theorem for cross t-intersecting families
- Codes with given distances
- New tools for graph coloring
- Problems from CGCS Luminy, May 2007
- On the Frankl-Rödl theorem
- From quantum query complexity to state complexity
- Generalizations of the distributed Deutsch-Jozsa promise problem
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Fractional \(L\)-intersecting families
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- On a Frankl-Wilson theorem
- Uniformly cross intersecting families
- Title not available (Why is that?)
- Bisecting and \(D\)-secting families for set systems
- System of unbiased representatives for a collection of bicolorings
- Strong Ramsey properties of simplices
- Quantum communication and complexity.
- 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
- Multicolour sunflowers
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
- Forbidding intersection patterns between layers of the cube
- On a Frankl-Rödl theorem and its geometric corollaries
- Improvements of the Frankl-Rödl theorem and geometric consequences
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- Lower bounds for the chromatic numbers of distance graphs with large girth
- A Partition Property of Simplices in Euclidean Space
- Exact solution of some Turán-type problems
- Monochromatic equilateral triangles in the unit distance graph
- A note on the stability number of an orthogonality graph
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
- Disjoint pairs in set systems with restricted intersection
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- On the chromatic number of a space with a forbidden regular simplex
- On chromatic numbers of nearly Kneser distance graphs
- Frankl-Rödl-type theorems for codes and permutations
- Hypergraph removal lemmas via robust sharp threshold theorems
- Title not available (Why is that?)
- A tale of stars and cliques
- Sabidussi versus Hedetniemi for three variations of the chromatic number
- Sets of vectors with many orthogonal pairs
- On cross-intersecting families
- An intersection problem for codes
- Edge-Ramsey theory
- A counterexample to Borsuk’s conjecture
- Convex relaxations and integrality gaps
- Finite Euclidean Ramsey theory
- Lower bounds for measurable chromatic numbers
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Hypercontractivity of Spherical Averages in Hamming Space
- On a restricted cross-intersection problem
- Invitation to intersection problems for finite sets
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- Proof of a conjecture of Erdős on triangles in set-systems
- Simplices and regular polygonal tori in Euclidean Ramsey theory
- Specified intersections
- Intersection statements for systems of sets
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits
- Set families with a forbidden pattern
- 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
- Deterministic quantum non-locality and graph colorings
- The chromatic number of space with forbidden regular simplex
- Forbidden vector-valued intersections
- Forbidden intersections for codes
- A recursive Lovász theta number for simplex-avoiding sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypercontractive inequalities via SOS, and the Frankl-Rödl graph
- On a Frankl-Wilson theorem and its geometric corollaries
- Intersection theorems for \((- 1, 0, 1)\)-vectors
- Robust Factorizations and Colorings of Tensor Graphs
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Orthonormal representations, vector chromatic number, and extension complexity
- Binary scalar products
- Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erdős/Ko/Rado Theorem
- \(d\)-Galvin families
- Lovász, vectors, graphs and codes
- Spread approximations for forbidden intersections problems
- Almost-Fisher families
- On minrank and the Lovász theta-function
- Exponentially Ramsey sets
- Streaming algorithms with one-sided estimation
- Turán numbers of sunflowers
- Title not available (Why is that?)
This page was built for publication: Forbidden Intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751579)
