Graphical enumeration and stained glass windows. I: Rectangular grids

MaRDI QIDQ3390423zbMATH OpenFDO

Authors L. Blomberg, S. R. Shannon, N. J. A. Sloane

Publication date 24 March 2022

Full work available at URL https://arxiv.org/abs/2009.07918, http://math.colgate.edu/~integers/graham5/graham5.pdf

zbMATH Keywords

enumerationplanar graphsrectangular grids

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Elementary problems in Euclidean geometries (51M04)

Abstract: A survey of enumeration problems arising from the study of graphs formed when the edges of a polygon are marked with evenly spaced points and every pair of points is joined by a line. A few of these problems have been solved, a classical example being the the graph K_n formed when all pairs of vertices of a regular n-gon are joined by chords, which was analyzed by Poonen and Rubinstein in 1998. Most of these problems are unsolved, however, and this two-part article provides data from a number of such problems as well as colored illustrations, which are often reminiscent of stained glass windows. The polygons considered include rectangles, hollow rectangles (or frames), triangles, pentagons, pentagrams, crosses, etc., as well as figures formed by drawing semicircles joining equally-spaced points on a line. %The paper ends with a brief discussion of the problem of how to %design aesthetically pleasing colorings for these graphs. This first part discusses rectangular grids. The 1 X n grids, or equally the graphs K_{n+1,n+1}, were studied by Legendre and Griffiths, and here we investigate the number of cells with a given number of edges and the number of nodes with a given degree. We have only partial results for the m X n rectangles, including upper bounds on the numbers of nodes and cells.

Recommendations

• Graphical enumeration and stained glass windows. I: Rectangular grids
• scientific article; zbMATH DE number 4093491
• scientific article; zbMATH DE number 3871396
• scientific article; zbMATH DE number 6025
• On the enumeration of a class of plane multigraphs

Cites work

• A Census of Planar Maps
• Counting the regions in a regular drawing of \(K_{n,n}\)
• GFUN
• scientific article; zbMATH DE number 3594346 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• scientific article; zbMATH DE number 1196086 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On the complexity of deciphering the threshold functions of \(k\)-valued logic
• On the enumeration of planar maps
• On the minimal teaching sets of two-dimensional threshold functions
• On the number of two-dimensional threshold functions
• Primitive Juggling Sequences
• The Historical Development of J. J. Sylvester's Four Point Problem
• The number of crossings in a regular drawing of the complete bipartite graph
• The Number of Intersection Points Made by the Diagonals of a Regular Polygon
• The Number of Regions Determined by a Convex Polygon
• The On-Line Encyclopedia of Integer Sequences

Cited in

(3)

• On the strange kinetic aesthetic of rectangular shape partitions
• Graphical enumeration and stained glass windows. I: Rectangular grids
• ``A handbook of Integer sequences fifty years later

Describes a project that uses

Uses Software

• gfun
• OEIS

This page was built for publication: Graphical enumeration and stained glass windows. I: Rectangular grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390423)