Simplify F4 faces – first version

Simplify F4 proof (FIRST VERSION)

This is an OLD page.

To simplify the map, you can remove two edges (not touching each other) of an F4. Since the other two faces, corresponding to the removed edges, may actually be the same face (if it goes around one of the other two neighbors of the F4), take care not to select such edges and select for removing the other two (this is provable as a consequence of the Jordan curve theorem). If you can color the map from which you removed the edges of the F4, when you restore the removed edges, will be always possible to find a color for the F4, since it will be surrounded by at most three colors (four neighbors two of which have the same color).


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s