On the chromatic numbers corresponding to exponentially Ramsey sets

DOI10.1007/s10958-020-04815-zzbMath1448.05124OpenAlexW3017056469MaRDI QIDQ2202680

Publication date: 29 September 2020

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-020-04815-z

zbMATH Keywords

exponentially Ramsey sets Nelson's problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Asymptotics of the independence number of a random subgraph of the graph $G(n, r, < s)$ ⋮ Estimate of the number of edges in subgraphs of a Johnson graph

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
New bounds for the chromatic number of a space with forbidden isosceles triangles
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
On the packing densities of superballs and other bodies
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
Exponentially Ramsey sets
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
Improved Frankl-Rödl theorem and some of its geometric consequences
Counterexamples to Borsuk's conjecture with large girth
On the chromatic numbers of low-dimensional spaces
Improvements of the Frankl-Rödl theorem and geometric consequences
Two notions of unit distance graphs
Turán-type results for distance graphs in an infinitesimal plane layer
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
The Mathematical Coloring Book
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$
Combinatorial Geometry and Coding Theory*
Covering space with convex bodies
The realization of distances within sets in Euclidean space
On the chromatic numbers of small-dimensional Euclidean spaces

This page was built for publication: On the chromatic numbers corresponding to exponentially Ramsey sets