{"id":1747,"date":"2015-08-01T01:00:54","date_gmt":"2015-08-01T01:00:54","guid":{"rendered":"http:\/\/blogs.ams.org\/visualinsight\/?p=1747"},"modified":"2015-09-12T06:34:31","modified_gmt":"2015-09-12T06:34:31","slug":"heawood-graph","status":"publish","type":"post","link":"https:\/\/blogs.ams.org\/visualinsight\/2015\/08\/01\/heawood-graph\/","title":{"rendered":"Heawood Graph"},"content":{"rendered":"
\n
\"Heawood<\/a>

Heawood Graph – Koko90<\/p><\/div>\n<\/div>\n

This is the Heawood graph<\/a>. This graph can be drawn on a torus with no edges crossing in such a way that it divides the torus into 7 hexagons, each pair of which shares an edge:<\/p>\n

\n
\"Heawood<\/a>

Heawood Graph Drawn on Torus<\/p><\/div><\/div>\n

In 1890, Percy John Heawood proved that for any map drawn on a torus, it takes at most 7 colors to ensure that no two countries sharing a common boundary have the same color. The Heawood graph proves that the number 7 is optimal.<\/p>\n

One nice way to construct the Heawood graph starts with the Fano plane<\/a>, the projective plane over the field \\(\\mathbb{F}_2\\). The Fano plane has 7 point and 7 lines:<\/p>\n

\n
\"Fano<\/a>

Fano Plane<\/p><\/div>\n<\/div>\n

The red vertices in the top picture of the Heawood graph correspond to the 7 points of the Fano plane, while the blue vertices correspond to the 7 lines. An edge connects a red vertex to a blue vertex iff the corresponding point lies on the corresponding line. So, we say the Heawood graph is the Levi graph<\/a> of the Fano plane. <\/p>\n

Since there are 7 points and 7 lines in the Fano plane, the Heawood graph has 14 vertices. Since each point in the Fano plane lies on 3 lines, the Heawood graph has 21 edges.<\/p>\n

The Fano plane has symmetry group \\(\\mathrm{PGL}(3,\\mathbb{F}_2),\\) a group with 168 elements. This group therefore also acts as symmetries of the Heawood graph. These symmetries send red vertices to red vertices and blue vertices to blue ones. However, the Heawood graph also has symmetries that switch red and blue vertices. These arise from the fact that the Fano plane is self-dual<\/b>: if we call points ‘lines’ and lines ‘points’, the resulting structure is again a copy of the Fano plane. <\/p>\n

The symmetry group of the Heawood graph has 336 elements, since half of the symmetries preserve the color of the vertices while the other half switch colors. In fact, this group is the automorphism group \\(\\mathrm{Aut}(\\mathrm{PGL}(3,\\mathbb{F}_2))\\). <\/p>\n

To see this, first note that \\(\\mathrm{Aut}(\\mathrm{PGL}(3,\\mathbb{F}_2))\\) contains \\(\\mathrm{PGL}(3,\\mathbb{F}_2)\\), which acts as inner automorphisms<\/a>. It also contains transposition <\/p>\n

$$ g \\mapsto g^\\top $$<\/p>\n

which is an outer automorphism<\/a> of order 2. Together with the 168 inner automorphisms, transposition generates \\(\\mathrm{Aut}(\\mathrm{PGL}(3,\\mathbb{F}_2))\\), which is a group of order 336. The inner automorphisms map the stabilizer of any point in the Fano plane to the stabilizer of another point, and map the stabilizer of any line to the stabilizer of another line. The outer automorphisms map the stabilizer of a point to the stabilizer of a line, and vice versa.<\/p>\n

In fact, we have <\/p>\n

$$ \\mathrm{PGL}(3,\\mathbb{F}_2) \\cong \\mathrm{PSL}(2,\\mathbb{F}_7) $$<\/p>\n

and <\/p>\n

$$ \\mathrm{Aut}(\\mathrm{PGL}(3,\\mathbb{F}_2)) \\cong \\mathrm{PGL}(2,\\mathbb{F}_7) $$<\/p>\n

so we can also understand the symmetries of the Fano plane and the Heawood graph in terms of \\(\\mathrm{PSL}(2,\\mathbb{F}_7) \\) and \\( \\mathrm{PGL}(2,\\mathbb{F}_7) \\), which act as symmetries of the projective line over the field with 7 elements, \\(\\mathbb{F}_7\\).<\/p>\n

The Heawood graph is also a (3,6)-graph<\/b>, meaning that every vertex has 3 neighbors and every cycle has length at least 6. It has the least possible number of vertices for a (3,6)-graph, so it is called a (3,6)-cage<\/b>. It is, in fact, the unique (3,6)-cage.<\/p>\n

There are 28 cycles of length 6 in the Heawood graph. These correspond to the 28 triangles in the Fano plane. <\/p>\n

For more, see:<\/p>\n

• Heawood graph<\/a>, Wikipedia<\/i>.<\/p>\n

• PSL(2,7)<\/a>, Wikipedia<\/i>.<\/p>\n

• Projective general linear group: PGL(2,7)<\/a>, Groupprops<\/i>.<\/p>\n

• Cage graph<\/a>, Wolfram Mathworld<\/i>.<\/p>\n

The featured picture of the Heawood graph was drawn by Koko90<\/a>, who placed it on Wikicommons<\/a> under a Creative Commons Attribution-Share Alike 3.0 Unported<\/a> license. David Eppstein<\/a> drew the Heawood graph on a torus, put it on Wikicommons<\/a>, and released it into the public domain. A German Wikicommons user named Gunther<\/a> drew the picture of the Fano plane, put it on Wikicommons<\/a>, and released it into the public domain.<\/p>\n

\n

Visual Insight<\/i> is a place to share striking images that help explain advanced topics in mathematics. I\u2019m always looking for truly beautiful images, so if you know about one, please drop a comment here<\/a> and let me know!<\/p>\n

<\/div>","protected":false},"excerpt":{"rendered":"

This is the Heawood graph<\/a>. This graph can be drawn on a torus with no edges crossing in such a way that it divides the torus into 7 hexagons, each pair of which shares an edge. In 1890, Percy John Heawood proved that for any map drawn on a torus, it takes at most 7 colors to ensure that no two countries sharing a common boundary have the same color. The Heawood graph proves that the number 7 is optimal.<\/p>\n

<\/div>\n","protected":false},"author":66,"featured_media":1787,"comment_status":"open","ping_status":"closed","sticky":true,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[21,22,23,2],"tags":[],"class_list":["post-1747","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-combinatorics","category-graphs","category-groups","category-images-library"],"jetpack_featured_media_url":"https:\/\/blogs.ams.org\/visualinsight\/files\/2015\/08\/heawood_graph.png","jetpack_shortlink":"https:\/\/wp.me\/p42Vmc-sb","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/1747","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/users\/66"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/comments?post=1747"}],"version-history":[{"count":26,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/1747\/revisions"}],"predecessor-version":[{"id":1750,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/1747\/revisions\/1750"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/media\/1787"}],"wp:attachment":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/media?parent=1747"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/categories?post=1747"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/tags?post=1747"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}