Intersection theorems with geometric consequences

From MaRDI portal

Publication:1171072

Jump to:navigation, search

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

Modular and fractional \(L\)-intersecting families of vector spaces, On chromatic numbers of close-to-Kneser distance graphs, Ramsey properties of algebraic graphs and hypergraphs, Hard graphs for randomized subgraph exclusion algorithms, Turán numbers of sunflowers, On the minimal number of edges in induced subgraphs of special distance graphs, Improved bounds on families under \(k\)-wise set-intersection constraints, Independence numbers and chromatic numbers of the random subgraphs of some distance graphs, Ramsey-type results for semi-algebraic relations, SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY, An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy, Fractional cross intersecting families, Small subgraphs and their extensions in a random distance graph, Extension complexity of low-dimensional polytopes, An improved universal bound for \(t\)-intersecting families, A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo \(p\), On the number of edges in a uniform hypergraph with a range of permitted intersections, Improved boolean formulas for the Ramsey graphs, A recursive Lovász theta number for simplex-avoiding sets, Intersecting families with sunflower shadows, On the number of edges of a uniform hypergraph with a range of allowed intersections, Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size, On a Frankl-Wilson theorem, Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs, Chromatic numbers of some distance graphs, A generalization of Kneser graphs, New bounds on clique-chromatic numbers of Johnson graphs, Set Systems with L-Intersections and k-Wise L-Intersecting Families, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), Unnamed Item, On the chromatic numbers corresponding to exponentially Ramsey sets, Unnamed Item, On the chromatic number for a set of metric spaces, On the Frankl–Rödl theorem, Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number, Almost-Fisher families, Restricted intersecting families on simplicial complex, On the number of zero-patterns of a sequence of polynomials, 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, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Polynomial configurations in sets of positive upper density over local fields, Almost-Fisher families, Exact modularity of line graphs of complete graphs, New lower bound on the modularity of Johnson graphs, Quasi-random graphs, Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Algebraic Properties of ModuloqComplete ℓ-Wide Families, The chromatic number of the space $( {\mathbb R}^n, l_1)$, An Introduction to Randomness Extractors, New bounds for the clique-chromatic numbers of Johnson graphs, On the Borsuk and Erdős-Hadwiger numbers, Violating the Shannon capacity of metric graphs with entanglement, Upper and lower Ramsey bounds in bounded arithmetic, New estimates in the problem of the number of edges in a hypergraph with forbidden intersections, Erdös–Ko–Rado Theorem—22 Years Later, A Partition Property of Simplices in Euclidean Space, Forbidden Intersections, Unnamed Item, Unnamed Item, Exponentially Ramsey sets, Distance graphs with large chromatic number and without cliques of given size in the rational space, Flattening rank and its combinatorial applications, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, On the chromatic number of a space with several forbidden distances, Lower bounds on the clique-chromatic numbers of some distance graphs, Around Borsuk's hypothesis, Chromatic numbers of metric spaces, On \(L\)-close Sperner systems, On subsets of the hypercube with prescribed Hamming distances, Chromatic numbers of Kneser-type graphs, Borsuk number for planar convex bodies, Unnamed Item, Bounds on the Maximum Number of Vectors with given Scalar Products, The Hadwiger–Nelson Problem, On lower bounds for the chromatic number of spheres, Clique chromatic numbers of intersection graphs, A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\), Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles, Improved Frankl-Rödl theorem and some of its geometric consequences, Borsuk's partition conjecture, New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\), Lower bounds for the measurable chromatic number of the hyperbolic plane, Frankl-Rödl-type theorems for codes and permutations, Explicit two-source extractors and resilient functions, Proof of a conjecture on induced subgraphs of Ramsey graphs, Large cliques and independent sets all over the place, Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs, Euclidean Ramsey theorems on the n‐sphere, All finite sets are Ramsey in the maximum norm, Specified intersections, New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs, On the Babai and Upper Chromatic Numbers of Graphs of Diameter 2, A counterexample to Borsuk’s conjecture, On the chromatic numbers of metric spaces with few forbidden distances, Borsuk's problem and the chromatic numbers of metric spaces, The density of sets avoiding distance 1 in Euclidean space, Spectrum of Johnson graphs, Diameters and Eigenvalues, Bounds for sets with few distances distinct modulo a prime ideal, The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, Large cycles in generalized Johnson graphs, Interview with Andrei Raigorodskii, Essentially tight kernels for (weakly) closed graphs, Uniform hypergraphs under certain intersection constraints between hyperedges, Independence numbers of Johnson-type graphs, More on lines in Euclidean Ramsey theory, On hierarchically closed fractional intersecting families, Geometrical sets with forbidden configurations, Ramsey properties of semilinear graphs, Maximal fractional cross-intersecting families, Lower bound on the minimum number of edges in subgraphs of Johnson graphs, Intersection theorems for \((- 1, 0, 1)\)-vectors, Graph-codes, Induced Ramsey-type theorems, Measurable sets with excluded distances, On mod-\(p\) Alon-Babai-Suzuki inequality, Monochromatic translates of configurations in the plane, Extremal case of Frankl-Ray-Chaudhuri-Wilson inequality, Constructive lower bounds for off-diagonal Ramsey numbers, Set systems with restricted intersections modulo prime powers, On a problem in combinatorial geometry, Modularity of some distance graphs, 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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1171072&oldid=13238709"