Intersection theorems with geometric consequences

DOI10.1007/BF02579457zbMath0498.05048MaRDI QIDQ1171072

Richard M. Wilson, Peter Frankl

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

set intersections

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

Related Items (only showing first 100 items - show all)

All rationals occur as exponents ⋮ Better bounds for planar sets avoiding unit distances ⋮ On generalizations of the deBruijn-Erdős theorem ⋮ On the chromatic numbers of integer and rational lattices ⋮ Strong Ramsey properties of simplices ⋮ Linear independence, a unifying approach to shadow theorems ⋮ Recent trends in Euclidean Ramsey theory ⋮ A new proof of several inequalities on codes and sets ⋮ On a bound in extremal combinatorics ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances ⋮ Sharp sets of permutations ⋮ On a restricted cross-intersection problem ⋮ On chromatic numbers of nearly Kneser distance graphs ⋮ A common generalization to theorems on set systems with \(\mathcal L\)-intersections ⋮ Note on induced subgraphs of the unit distance graph \(E^ n\) ⋮ Finite Euclidean Ramsey theory ⋮ Exact solution of some Turán-type problems ⋮ Proof of a conjecture of Frankl and Füredi ⋮ Bounding one-way differences ⋮ Edge-Ramsey theory ⋮ Determination of the residue classes of a polynomial at integral arguments ⋮ Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm ⋮ Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function ⋮ Constructive bounds for a Ramsey-type problem ⋮ On the structure of distance graphs with large chromatic numbers ⋮ Some recent results on Ramsey-type numbers ⋮ 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ A new Alon-Babai-Suzuki-type inequality on set systems ⋮ Constructing Ramsey graphs from Boolean function representations ⋮ Partitions of nonzero elements of a finite field into pairs ⋮ Ranks of matrices with few distinct entries ⋮ On the maximal number of edges in a uniform hypergraph with one forbidden intersection ⋮ On lower bounds for the chromatic number of sphere ⋮ An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges ⋮ Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors ⋮ Grid Ramsey problem ⋮ On weighted zero-sum sequences ⋮ Restricted \(t\)-wise \(\mathcal{L}\)-intersecting families on set systems ⋮ A new short proof of the EKR theorem ⋮ Families of vector spaces with \(r\)-wise \(\mathcal{L}\)-intersections ⋮ Chromatic numbers of spaces with forbidden monochromatic triangles ⋮ On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems ⋮ An intersection problem whose extremum is the finite projective space ⋮ Set-systems with prescribed cardinalities for pairwise intersections ⋮ On four-colourings of the rational four-space ⋮ On the chromatic numbers of spheres in \(\mathbb R^n\) ⋮ A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials ⋮ Extremal set systems with restricted \(k\)-wise intersections. ⋮ On the chromatic number of \(\mathbb R^4\) ⋮ A sharpening of Fisher's inequality ⋮ Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems ⋮ 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 ⋮ Lines in Euclidean Ramsey theory ⋮ A note on Euclidean Ramsey theory and a construction of Bourgain ⋮ Unavoidable hypergraphs ⋮ Privileged users in zero-error transmission over a noisy channel ⋮ The chromatic number of space with forbidden regular simplex ⋮ On random subgraphs of Kneser graphs and their generalizations ⋮ Bounds on degrees of \(p\)-adic separating polynomials ⋮ Ball packings with high chromatic numbers from strongly regular graphs ⋮ Forbidden configurations and Steiner designs ⋮ The complexity of explicit constructions ⋮ Fractional \(L\)-intersecting families ⋮ Distance graphs with large chromatic numbers and small clique numbers ⋮ Cross \(\mathcal L\)-intersecting families on set systems ⋮ Alon-Babai-Suzuki's inequalities, Frankl-Wilson type theorem and multilinear polynomials ⋮ Set systems with positive intersection sizes ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ The Borsuk partition problem: the seventieth anniversary ⋮ Uniformly cross intersecting families ⋮ Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory ⋮ A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality ⋮ On subsets with cardinalities of intersections divisible by a fixed integer ⋮ Set systems with \(\mathcal L\)-intersections modulo a prime number ⋮ Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances ⋮ Invitation to intersection problems for finite sets ⋮ On set systems with restricted intersections modulo \(p\) and \(p\)-ary \(t\)-designs ⋮ Polynomial spaces ⋮ Ramsey-type theorems ⋮ Intersection theorems and mod \(p\) rank of inclusion matrices ⋮ Families of finite sets with three intersections ⋮ Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space ⋮ Approximating hyper-rectangles: Learning and pseudorandom sets ⋮ A generalization of Fisher's inequality ⋮ Bounds on the measurable chromatic number of \({\mathbb{R}}\) ⋮ Multilinear polynomials and a conjecture of Frankl and Füredi ⋮ Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families ⋮ On the vector space of 0-configurations ⋮ Lower bounds for measurable chromatic numbers ⋮ On functions of strength t ⋮ Some results on intersecting families of subsets ⋮ Linear dependencies among subsets of a finite set ⋮ An extremal set theoretical characterization of some Steiner systems ⋮ Sharpness of some intersection theorems ⋮ Forbidding just one intersection ⋮ Intersection theorems for vector spaces ⋮ On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances ⋮ On families in finite lattices ⋮ Independence numbers and chromatic numbers of some distance graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On set intersections
• A finite set intersection theorem
• Extremal problems and coverings of the space
• On t-designs
• A note on the realization of distances within sets in euclidean space
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Families of finite sets with prescribed cardinalities for pairwise intersections
• Intersection Properties of Systems of Finite Sets
• The realization of distances within sets in Euclidean space
• Some remarks on the theory of graphs

This page was built for publication: Intersection theorems with geometric consequences