Skip to main content

Advertisement

SpringerLink
  • Log in
  1. Home
  2. Discrete & Computational Geometry
  3. Article
The Honeycomb Conjecture
Download PDF
Your article has downloaded

Similar articles being viewed by others

Slider with three articles shown per slide. Use the Previous and Next buttons to navigate the slides or the slide controller buttons at the end to navigate through each slide.

Farber’s conjecture for planar graphs

13 September 2021

Ben Knudsen

Planarity and non-separating cycles in uniform high genus quadrangulations

05 April 2021

Baptiste Louf

The enumeration of extreme rigid honeycombs

16 August 2022

Hari Bercovici & Wing Suet Li

Ferrers graphs, D-permutations, and surjective staircases

07 June 2022

Alexander Lazar

Zilber’s Theorem for planar lattices, revisited

01 June 2020

Kirby A. Baker & George Grätzer

On the Ramsey-Turán Density of Triangles

24 November 2021

Tomasz Łuczak, Joanna Polcyn & Christian Reiher

Computing the Multicover Bifiltration

20 February 2023

René Corbet, Michael Kerber, … Georg Osang

An Introduction to the Circle Method of Hardy, Littlewood, and Ramanujan

25 January 2021

Stephen Wainger

Two Identities

01 October 2019

Chanchal Kumar

Download PDF
  • Published: 01 January 2001

The Honeycomb Conjecture

  • T. C. Hales1 

Discrete & Computational Geometry volume 25, pages 1–22 (2001)Cite this article

  • 4107 Accesses

  • 279 Citations

  • 39 Altmetric

  • Metrics details

Abstract

This article gives a proof of the classical honeycomb conjecture: any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling.

Download to read the full article text

Working on a manuscript?

Avoid the most common mistakes and prepare your manuscript for journal editors.

Learn more

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Michigan, Ann Arbor, MI 48109, USA, USA

    T. C. Hales

Authors
  1. T. C. Hales
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received August 30, 1999, and in revised form April 17, 2000. Online publication September 22, 2000.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Hales, T. The Honeycomb Conjecture. Discrete Comput Geom 25, 1–22 (2001). https://doi.org/10.1007/s004540010071

Download citation

  • Published: 01 January 2001

  • Issue Date: January 2001

  • DOI: https://doi.org/10.1007/s004540010071

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Download PDF

Working on a manuscript?

Avoid the most common mistakes and prepare your manuscript for journal editors.

Learn more

Advertisement

Over 10 million scientific documents at your fingertips

Switch Edition
  • Academic Edition
  • Corporate Edition
  • Home
  • Impressum
  • Legal information
  • Privacy statement
  • California Privacy Statement
  • How we use cookies
  • Manage cookies/Do not sell my data
  • Accessibility
  • FAQ
  • Contact us
  • Affiliate program

Not logged in - 18.206.92.240

Not affiliated

Springer Nature

© 2023 Springer Nature Switzerland AG. Part of Springer Nature.