On a generalization of the Hadwiger-Nelson problem

DOI10.1007/S11856-017-1448-4zbMATH Open1360.05050arXiv1507.05300OpenAlexW2963426069MaRDI QIDQ522309FDOQ522309

Mohammad Bardestani, Keivan Mallahi Karai

Publication date: 28 April 2017

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: For a field $F$ and a quadratic form $Q$ defined on an $n$-dimensional vector space $V$ over $F$, let $mathrm{QG}_Q$, called the quadratic graph associated to $Q$, be the graph with the vertex set $V$ where vertices $u,winV$ form an edge if and only if $Q(v-w)=1$. Quadratic graphs can be viewed as natural generalizations of the unit-distance graph featuring in the famous Hadwiger-Nelson problem. In the present paper, we will prove that for a local field $F$ of characteristic zero, the Borel chromatic number of $mathrm{QG}_Q$ is infinite if and only if $Q$ represents zero non-trivially over $F$. The proof employs a recent spectral bound for the Borel chromatic number of Cayley graphs, combined with an analysis of certain oscillatory integrals over local fields. As an application, we will also answer a variant of question 525 proposed in the 22nd British Combinatorics Conference 2009.

Full work available at URL: https://arxiv.org/abs/1507.05300

Recommendations

• On the chromatic numbers of rational spaces
• scientific article; zbMATH DE number 1552837
• Distance graphs from \(p\)-adic norms
• The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
• Chromatic number of graphs with special distance sets. I

zbMATH Keywords

Cayley graphsquadratic graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The realization of distances in measurable subsets covering \(R^ n\).
• A model of set-theory in which every set of reals is Lebesgue measurable
• The Mathematical Coloring Book
• Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
• Fourier Analysis on Local Fields. (MN-15)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The total graph of a commutative ring
• Lower bounds for measurable chromatic numbers
• Special functions on locally compact fields
• The clique numbers of regular graphs of matrix algebras are finite
• Measurable sets with excluded distances
• Spectral bounds for the independence ratio and the chromatic number of an operator
• Research problems from the BCC22
• An introduction to \(p\)-adic fields, harmonic analysis and the representation theory of \(\text{SL}_2\)
• Distances realized by sets covering the plane
• Axiom of choice and chromatic number: Examples on the plane

Cited In (3)

• Polynomial configurations in sets of positive upper density over local fields
• On the chromatic number of structured Cayley graphs
• On a generalization of the Oberwolfach problem

This page was built for publication: On a generalization of the Hadwiger-Nelson problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522309)