scientific article; zbMATH DE number 1760745
A packing of congruent equilateral triangles in the plane is called complete, if only vertex points are common points of triangles, and every vertex point belongs to exactly two of the triangles. The authors exhibit complete packings of \(n\) congruent equilateral triangles for all even \(n\geq 42\). They are constructed from smaller conglomerates with only a few single vertex points, i.e. vertex points that belong to just one triangle. If the number of triangles is odd then there is always at least one single vertex point. The authors construct such nearly complete packings with just one vertex point for all odd \(n\geq 35\) and for \(n= 31\) triangles. Whether these numbers are minimal remains an open problem.
- scientific article; zbMATH DE number 2063913
- Packing triangles in a graph and its complement
- scientific article; zbMATH DE number 1382592
- Packing and covering a unit equilateral triangle with equilateral triangles
- Densest Packings of Congruent Circles in an Equilateral Triangle
- Packing of equal disks in an equilateral triangle: On a conjecture of Erdős-Oler
- scientific article; zbMATH DE number 2149368
- Packing and covering triangles in graphs
- Packing a triangle with positive homothetical copies
- Packings and coverings of v=3m+1 points with near-triangle factors
- Optimal translative packing of homothetic triangles
- scientific article; zbMATH DE number 2063913 (Why is no real title available?)
- scientific article; zbMATH DE number 2149368 (Why is no real title available?)
- scientific article; zbMATH DE number 1382592 (Why is no real title available?)
- scientific article; zbMATH DE number 7647887 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537233)
