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

DOI10.1007/BF02579223zbMATH Open0558.05020OpenAlexW2044896787MaRDI QIDQ762489FDOQ762489

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

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

zbMATH Keywords

geometric graphindependent setsmeasurable chromatic numberLebesgue upper density

Mathematics Subject Classification ID

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

Cites Work

• The realization of distances in measurable subsets covering \(R^ n\).
• Intersection theorems with geometric consequences
• The realization of distances within sets in Euclidean space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distances realized by sets covering the plane

Cited In (9)

• Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
• Better bounds for planar sets avoiding unit distances
• Same graph, different universe
• The fractional chromatic number of the plane
• The density of planar sets avoiding unit distances
• Winning Fast in Sparse Graph Construction Games
• Geometrical sets with forbidden configurations
• Bounds on the measurable chromatic number of \({\mathbb{R}}\)
• Title not available (Why is that?)

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)