2013/10/12 by Tri Lai, Lai, Tri
Engineering · Mathematics · #05A15 #05E99 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.CO #msc:05A15 #msc:05E99
paper · pdf · doi:10.48550/arxiv.1310.3332
25 pages; fixed typos
openalex publication_date 2013/10/12 · arxiv created 2014/09/07 · arxiv updated 2014/09/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We use the subgraph replacement method to prove a simple product formula for the tilings of an 8-vertex counterpart of Propp's quasi-hexagons (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999), called quasi-octagon.