I’m trying to come up with a map that fits the following description. I’ll give a quasi-technical description first, then a more plain-english summary.
Maps are made of regions. And finite maps on a plane have an external edge, outside of which we could say there is a single “external region”. The external region is not part of the map–it is a single region outside every region on the map.*
Each region in the map has an E-index. A region R’s E-index is defined as the smallest number of curve segments a line segment with one enpoint inside R must cross in order to have an endpoint within the map’s external region. (In other words, to have an endpoint external to the entire map.)
Some regions have an E-index of 1. These are the regions bordering the external region.
Some regions have an E-index of 2. These are the regions bordering regions of E-index 1 while not also bordering the external region.
Call the E-index 1 regions the Border regions. Call the E-index 2 regions the Second Layer regions.
Okay, here’s what I’m trying to do. I’m trying to come up with a map which satisfies the following description: No matter how you 3-color the map’s border regions**, you must use four colors in order to color the map’s Second Layer regions, if your coloring of the Border and Second Layer regions is to satisfy the constraint that no two adjacent regions have the same color.
I said I’d give a plain english version afterwards, but actually I think the above was clear, so never mind.
Why am I asking about this? I’ve been trying to prove the 4-color map theorem off and on since I was a kid, and I’m not about to let the fact that it’s already been proven stop me. If no map like the one I described can be constructed, then I think I can prove the theorem. Since it is almost certainly the case that I can’t prove it, chances are that such a map can be constructed. But my fiddling around hasn’t produced one. I was wondering how many seconds it would take for someone who is not me to produce one.
*Actually you could have “external regions” which are actually more like holes in the map, and you could have any number of these. But let’s not complicate things. Let’s just think about the big single external region that’s intuitively external rather than internal to the map.
**The truth of the 4-color map theorem guarantees that you need at most 3 colors to color in all a map’s Border regions, if your coloring is to satisfy the condition that no two adjacent regions have the same color. For if you needed four colors for these regions, then there would be map identical to this one but with a single further region surrounding these erstwhile Border regions, and that single further region would require a fifth color.