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