Hostname: page-component-745bb68f8f-b6zl4 Total loading time: 0 Render date: 2025-01-11T21:53:23.049Z Has data issue: false hasContentIssue false
  • English
  • Français

Applications of Euler’s formula to partition problems

Published online by Cambridge University Press:  01 August 2016

Duane Detemple
Duane Detemple*
Affiliation:
Department of Mathematics, Washington State University, Pullman, Washington 99164-2930, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Extract

In this article several combinatorial problems are posed for the partitioning of certain plane figures. The solutions are obtained by means of Euler’s formula for plane graphs or networks, V - E + R = 1, where V is the number of vertices, E is the number of edges, and R is the number of bounded regions of the figure. Being unified by the common thread of Euler’s formula, the sequence of problems forms an interesting unit on solving related problems.

Type
Research Article
Information
The Mathematical Gazette , Volume 71 , Issue 456 , June 1987 , pp. 104 - 107
Copyright
Copyright © Mathematical Association 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)