Exponentially Ramsey sets
From MaRDI portal
Publication:2278704
Recommendations
- On the chromatic numbers corresponding to exponentially Ramsey sets
- Exponential patterns in arithmetic Ramsey theory
- On Ramsey families of sets
- An excursion into nonlinear Ramsey theory
- On completely Ramsey sets
- Exponential lower bound for Berge-Ramsey problems
- scientific article; zbMATH DE number 863494
- Ramsey-type theorems
- Bounding some Ramsey functions
- scientific article; zbMATH DE number 1341925
Cites work
- A Partition Property of Simplices in Euclidean Space
- All regular polytopes are Ramsey
- All trapezoids are Ramsey
- All Triangles are Ramsey
- Around Borsuk's hypothesis
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Combinatorial geometry and coding theory
- Edge-Ramsey theory
- Euclidean Ramsey theorems. I
- Forbidden Intersections
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3489127 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 2112063 (Why is no real title available?)
- scientific article; zbMATH DE number 3246419 (Why is no real title available?)
- scientific article; zbMATH DE number 3340240 (Why is no real title available?)
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Improvements of the Frankl-Rödl theorem and geometric consequences
- 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
- Intersection theorems with geometric consequences
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On a bound in extremal combinatorics
- On Orthogonal Matrices
- On the chromatic number of a space
- On the chromatic number of a space with a forbidden regular simplex
- On the chromatic number of a space with forbidden equilateral triangle
- On the chromatic number of with an arbitrary norm
- On the Frankl-Rödl theorem
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Permutation Groups in Euclidean Ramsey Theory
- Strong Ramsey properties of simplices
- The chromatic number of a space with the metric l_q
- The chromatic number of the plane is at least 5
- The difference between consecutive primes. II
- The realization of distances within sets in Euclidean space
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
Cited in
(14)- On a Frankl-Wilson theorem
- Estimate of the number of edges in special subgraphs of a distance graph
- On the chromatic numbers corresponding to exponentially Ramsey sets
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- The number of edges in induced subgraphs of some distance graphs
- Counterexamples to Borsuk's conjecture with large girth
- Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions
- All finite sets are Ramsey in the maximum norm
- Ramsey theory in the \(n\)-space with Chebyshev metric
- Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions
- Max-norm Ramsey theory
- On a Frankl-Wilson theorem and its geometric corollaries
- Cutting corners
This page was built for publication: Exponentially Ramsey sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278704)
