Show simple item record

The Honeycomb Conjecture

dc.contributor.authorHales, T. C.en_US
dc.date.accessioned2006-09-08T20:19:27Z
dc.date.available2006-09-08T20:19:27Z
dc.date.issued2001-01en_US
dc.identifier.citationHales, T. C.; (2001). "The Honeycomb Conjecture." Discrete & Computational Geometry 25(1): 1-22. <http://hdl.handle.net/2027.42/42423>en_US
dc.identifier.issn0179-5376en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/42423
dc.description.abstractThis 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.en_US
dc.format.extent128788 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherSpringer-Verlag; 2000 Springer-Verlag New Yorken_US
dc.subject.otherLegacyen_US
dc.titleThe Honeycomb Conjectureen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, MI 48109, USA, USen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/42423/1/454-25-1-1_10071.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/s004540010071en_US
dc.identifier.sourceDiscrete & Computational Geometryen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.