Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space

DOI10.1007/BF02579223MaRDI QIDQ762489zbMATH OpenOpenAlexFDO

Authors László A. Székely

Publication date 1984

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02579223

zbMATH Keywords

geometric graphindependent setsLebesgue upper densitymeasurable chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Review text

The paper deals with independent sets in graphs \(G_ H\) for \(H\subseteq {\mathbb{R}}^+\) (the vertex set is \({\mathbb{R}}^ n\) and two vertices are joined if their distance belongs to H). The Lebesgue upper density of independent sets and the minimum number of classes in a measurable partition into independent sets are considered.

Recommendations

• scientific article; zbMATH DE number 3851122
• The chromatic numbers of some Euclidean distance graphs
• Independence numbers and chromatic numbers of some distance graphs
• On the chromatic number of a space
• Distance graphs with large chromatic number and without large cliques

Cites work

• Distances realized by sets covering the plane
• scientific article; zbMATH DE number 3838820 (Why is no real title available?)
• scientific article; zbMATH DE number 3179708 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• Intersection theorems with geometric consequences
• The realization of distances in measurable subsets covering R^ n.
• The realization of distances within sets in Euclidean space

Cited in

(11)

• Bounds on the measurable chromatic number of \({\mathbb{R}}\)
• A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
• Same graph, different universe
• Better bounds for planar sets avoiding unit distances
• scientific article; zbMATH DE number 3851122 (Why is no real title available?)
• Winning Fast in Sparse Graph Construction Games
• Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
• Geometrical sets with forbidden configurations
• The density of planar sets avoiding unit distances
• A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
• The fractional chromatic number of the plane

This page was built for publication: Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space

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