Max-norm Ramsey theory
From MaRDI portal
Publication:6201895
DOI10.1016/j.ejc.2024.103918arXiv2111.08949OpenAlexW4391460847WikidataQ128867906 ScholiaQ128867906MaRDI QIDQ6201895
Arsenii Sagdeev, Nóra Frankl, Andrey B. Kupavskii
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.08949
Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the density Hales-Jewett theorem
- On the chromatic number of with an arbitrary norm
- Transitive sets in Euclidean Ramsey theory
- All regular polytopes are Ramsey
- Covering and packing in \({\mathbb Z^n}\) and \({\mathbb R^n}\). II
- Alternative proof of Sine's theorem on the size of a regular polygon in \(\mathbb{R}{}^ n\) with the \(\ell{}_ \infty\)-metric
- All trapezoids are Ramsey
- Cardinalities of \(k\)-distance sets in Minkowski spaces
- Recent trends in Euclidean Ramsey theory
- Euclidean Ramsey theorems. I
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Lines in Euclidean Ramsey theory
- A density version of the Hales-Jewett theorem
- Odd-distance and right-equidistant sets in the maximum and Manhattan metrics
- Domination ratio of a family of integer distance digraphs with arbitrary degree
- The chromatic number of the plane is at least 5: a new proof
- Exponentially Ramsey sets
- Sequences of integers with three missing separations
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- Covering and packing in \({\mathbb Z}^n\) and \({\mathbb R}^n\). I
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- A decomposition theorem for partially ordered sets
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- On covering by translates of a set
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- A note on near-optimal coloring of shift hypergraphs
- A Partition Property of Simplices in Euclidean Space
- The Mathematical Coloring Book
- Regularity and Positional Games
- Permutation Groups in Euclidean Ramsey Theory
- On the chromatic number of a space
- The chromatic number of the plane is at least 5
- The chromatic number of a space with the metric $ l_q$
- All finite sets are Ramsey in the maximum norm
- The structure of translational tilings in $\mathbb{Z}^d$
- Monochromatic equilateral triangles in the unit distance graph
- Periodicity and decidability of tilings of ℤ2
- Polychromatic Colorings on the Integers
- Covering space with convex bodies
- The realization of distances within sets in Euclidean space
- Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
- Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions
- Undecidable translational tilings with only two tiles, or one nonabelian tile
This page was built for publication: Max-norm Ramsey theory
