Intersection graphs for families of balls in \(R^n\)

DOI10.1016/S0195-6698(88)80007-6zbMath0659.05079OpenAlexW2154790163WikidataQ59701045 ScholiaQ59701045MaRDI QIDQ1112070

Paul Erdős, T. D. Parsons, Steven G. Krantz, Chris D. Godsil

Publication date: 1988

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(88)80007-6

zbMATH Keywords

Euclidean spaceintersection graphballepsilon-disjoint

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (5)

Sphere packings give an explicit bound for the Besicovitch covering theorem ⋮ The coordinate representation of a graph and \(n\)-universal graph of radius 1 ⋮ The Besicovitch covering lemma and maximal functions ⋮ Fatou theorems on domains in 𝐂ⁿ ⋮ Invariant metrics and the boundary behavior of holomorphic functions on domains in \({\mathbb{C}}^ n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space graphs and sphericity
• On the sphericity and cubicity of graphs
• On the sphericity for the join of many graphs
• Contact patterns of equal nonoverlapping spheres
• Parallel concepts in graph theory
• Antisocial Subcovers of Self-Centered Coverings
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Intersection graphs for families of balls in \(R^n\)