Exponentially Ramsey sets
From MaRDI portal
Publication:2278704
DOI10.1134/S0032946018040051zbMath1428.05117OpenAlexW2912409941MaRDI QIDQ2278704
Publication date: 10 December 2019
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946018040051
Related Items (12)
On a Frankl-Wilson theorem ⋮ Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions ⋮ Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ Max-norm Ramsey theory ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ Ramsey theory in the -space with Chebyshev metric ⋮ 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 \(\ell_1\) and \(\ell_2\) ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ All finite sets are Ramsey in the maximum norm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 the chromatic number of with an arbitrary norm
- All regular polytopes are Ramsey
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Intersection theorems with geometric consequences
- All trapezoids are Ramsey
- Euclidean Ramsey theorems. I
- On a bound in extremal combinatorics
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Strong Ramsey properties of simplices
- Edge-Ramsey theory
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the chromatic number of a space with a forbidden regular simplex
- Improvements of the Frankl-Rödl theorem and geometric consequences
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Around Borsuk's hypothesis
- The Difference Between Consecutive Primes, II
- Borsuk's problem and the chromatic numbers of some metric spaces
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Coloring Distance Graphs and Graphs of Diameters
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- Forbidden Intersections
- Permutation Groups in Euclidean Ramsey Theory
- On the chromatic number of a space
- The chromatic number of the plane is at least 5
- On the Frankl–Rödl theorem
- The chromatic number of a space with the metric $ l_q$
- On Orthogonal Matrices
- Combinatorial Geometry and Coding Theory*
- On the chromatic number of a space with forbidden equilateral triangle
- The realization of distances within sets in Euclidean space
- On the chromatic numbers of small-dimensional Euclidean spaces
This page was built for publication: Exponentially Ramsey sets
