I know that according to Euler's formula in graph theory the average number of edges or vertices in a planar connected graph cannot exceed six. So it seems according to Euler's formula its not possible mesh any plane using only heptagons (or say 80-90% heptagons). I am trying to write a code in MATLAB to mesh a rectangular domain using heptagons but don't know if its possible or not. Can someone tell me if its possible and if yes, then why?
2026-03-24 23:53:27.1774396407
Can we mesh a rectangle using only heptagons?
249 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GEOMETRY
- Point in, on or out of a circle
- Find all the triangles $ABC$ for which the perpendicular line to AB halves a line segment
- How to see line bundle on $\mathbb P^1$ intuitively?
- An underdetermined system derived for rotated coordinate system
- Asymptotes of hyperbola
- Finding the range of product of two distances.
- Constrain coordinates of a point into a circle
- Position of point with respect to hyperbola
- Length of Shadow from a lamp?
- Show that the asymptotes of an hyperbola are its tangents at infinity points
Related Questions in COMPUTATIONAL-MATHEMATICS
- The equivalent of 'quantum numbers' for a mathematical problem
- Skewes' number, and the smallest $x$ such that $\pi(x) > \operatorname{li}(x) - \tfrac1n \operatorname{li}(x^{1/2})$?
- Approximating a derivative through Newton interpolation
- What is the value of $2x+3y$?
- Good free calculator for manipulating symbolic matrices of 6x6 and larger?
- How to convert an approximation of CCDF for a standard normal to an approximation with a different mean and variance?
- Simple recursive algorithms to manually compute elementary functions with pocket calculators
- Asymptotic notation proof
- Graph layout that reflects graph symmetries
- What is the most efficient computation of the permanent?
Related Questions in FINITE-ELEMENT-METHOD
- What is the difference between Orthogonal collocation and Weighted Residual Methods
- Lagrange multiplier for the Stokes equations
- Does $(q,\nabla u)\lesssim C|u|_1$ implies $\Vert q\Vert_0\lesssim C$?
- How to approximate numerically the gradient of the function on a triangular mesh
- Proving $||u_h||_1^2=(f,u_h)$ for mixed finite elements
- Function in piecewise linear finite element space which satisfies the divergence-free condition is the zero function
- Implementing boundary conditions for the Biharmonic equation using $C^1$ elements.
- Deriving the zero order jump condition for advection equation with a source?
- Definition of finite elements (Ciarlet)
- finite elements local vs global basisfunction
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
It is perfectly possible to tile a finite region of the plane using heptagons, it is just that they won't all have the same size and shape. The more tiles you use, the more they get distorted towards the edge of your region.
For example, take a look at this representation of the heptagonal tiling of the hyperbolic plane:
(Picture was taken from this wiki page)
In a so-called hyperbolic plane, this would be a regular tiling. Loosely speaking, a hyperbolic plane gives you more than 360 degrees of angle space at every point, allowing you to fit three regular heptagons together. In the normal Euclidean plane this is not the case, which is why in this flat-plane picture the heptagons are distorted. They get smaller the further from the centre in order to fit them all into the flat plane while still keeping them essentially the same shape.
If you cut out a rectangle from that picture, you have a tiling of that rectangle with heptagons (except for the tiles at the edges, but that is unavoidable).
You don't have to make the outer heptagons smaller in area, but you will find that they have to be narrower. If you start with a central regular heptagon, and add a layer of heptagons around it, then surround that by another layer, and so on, then with each layer you get more and more tiles than should fit in the flat plane. The only way to have each tile have the same area as a tile in the previous layer is to make each successive layer thicker by stretching the heptagons in the radial direction.
So you can tile a region of the plane with heptagons, but the more tiles you use, the worse it gets around the boundary. Essentially Euler's formula gets imbalanced, and this gets compensated for at the boundary by having more and more vertices that don't have neighbouring tiles (yet).
EDIT:
I'll use "unmatched vertex" to mean a vertex that is adjacent to only one tile, so has only two edges coming from it. A finished tiling has no unmatched vertices. An unmatched vertex needs (at least) two more tiles placed next to it, or equivalently needs (at least) one more edge added to it.
In a patch of heptagons, the ones on the boundary generally have 3 or 4 unmatched vertices. So there are 1 or 2 edges between two unmatched vertices on each boundary heptagon. If you add a layer of pentagons around them, each pentagon on such an edge will introduce another unmatched vertex that you have to deal with.
Therefore you will either need further partial layers pentagons (this makes some of the pentagons internal to the tiling, which may be undesirable), or you will need some quadrilaterals as well.
A layer of pentagons and quadrilaterals is sufficient. Simply add edges from the unmatched vertices of the patch of heptagons to the outer rectangle.
EDIT 2:
Here is a table showing the number for each extra layer of heptagons placed around a central heptagon.
The first two columns show the two types of heptagons in the outer layer, those with 3 and those with 2 unmatched vertices. The third column is the total number of heptagons from all layers so far.
Each row is easily calculated from the previous row. If the $n$th row is $a_n$, $b_n$, $c_n$, then we have $a_n=2a_{n-1}+b_{n-1}$, and $b_n=a_{n-1}+b_{n-1}$. We also obviously have $c_n=c_{n-1} + a_n+b_n$.
If you have your rectangle cut through all the heptagons in the outer layer, then the heptagons with 3 unmatched vertices become quadrilaterals, and those with two become pentagons. The fraction of quadrilaterals is therefore $a_n/c_n$, the fraction of pentagons $b_n/c_n$, leaving $1-a_n/c_n-b_n/c_n$ for the fraction of heptagons.
The limit for the fraction of heptagons is about $38.1966\%$. You could solve the recurrence relations to prove this is $(3-\sqrt{5})/2$.
Note that if you arrange the heptagons differently, then it will be less compact and expose more vertices on the boundary, making the fraction of heptagons smaller.
Even if you let the heptagons share an edge with the rectangle boundary, and fill in the remaining boundary gaps with triangles and pentagons, I think you still won't get more than about 50% heptagons in your mesh. Reaching 80-90% is not possible.