MathDBRingle circle problem
Ringle circle problem
A tangent graph of a finite collection of circles in the plane has one vertex for each circle and an edge when two circles are tangent. Assume that no more than two circles pass through any point. Ringle circle problem. Tangent graphs for finite collections of circles in the plane satisfying this assumption have bounded chromatic numbers. The source gives no resolution status.
Sources & referencesView supporting material
Primary source
Gil Kalai, “Some old and new problems in combinatorial geometry I: Around Borsuk's problem”, arXiv:1505.04952 (2015).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.