11170
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
An Infinitely Colorable Set of 3D Regions
Suppose that if two regions touch, then they should have different colors. How many colors suffice? In the plane, four colors are sufficient. In 3D, the set of regions shown requires an infinite number of colors.
Contributed by:
Jon Perry
THINGS TO TRY
Rotate and Zoom in 3D
Automatic Animation
SNAPSHOTS
RELATED LINKS
Four-Color Theorem
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
An Infinitely Colorable Set of 3D Regions
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/AnInfinitelyColorableSetOf3DRegions/
Contributed by:
Jon Perry
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Four-Color Maps
Ed Pegg Jr
Mondrian Four-Coloring
Ed Pegg Jr
Minimal Coloring of Platonic Solids
Jenna Pew and Theodore S. Erickson
Random 3D Nearest Neighbor Networks
Yifan Hu and Stephen Wolfram
Exploring Relations on Sets
Marc Brodie (Wheeling Jesuit University)
Four-Coloring Real Maps
Mark McClure
Coloring Cycle Decompositions in Complete Graphs on a Prime Number of Vertices
Michael Morrison
Slider Puzzle
Jon McLoone
Realization of Heawood's Map on a Toroidal Polyhedron
Izidor Hafner and Lajos Szilassi
The Colorit Puzzle
Karl Scherer
Related Topics
Color
Discrete Mathematics
Graph Theory
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+