Skip to content
DraconiticResearch
Search Sources API
201,642 studies31 sourcesUpdated 13 min ago
PreprintCC BY 4.0arXiv

One and Seven-Eighths Divisibility Problems of Propp

  • Aidan Dunkelberg
Open at sourcePDFDOICite

Abstract

We provide one full solution, and another nearly complete solution, to two problems from Jim Propp's 1999 article "Enumeration of matchings; problems and progress" (namely, Problems 30 and 31) involving divisibility properties of the number of matchings of two non-bipartite triangular graphs. We extend our method of proof of the second problem to show that the number of matchings of any graph composed of tetrahedral cells, such that the number of cells is suitably few relative to the number of vertices, is divisible by a power of 3; in particular, we then exhibit a collection of non-planar graphs whose number of matchings is divisible by 3.

Related

  1. ON DIVISIBILITY PROPERTIES OF ZIPF LAW AND RELATIVES
    Thierry E Huillet
    HALPreprintPublisher termsFull textProbabilityHALarXiv
  2. Congruence-simple multiplicatively idempotent semirings and multiplicative divisibility
    Damian Siejwa
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. Quadratic polynomials preserving free infinite divisibility
    Wiktor Ejsmont, Franz Lehner, Mihai Popa +1
    arXivPreprintCC BY-NC-ND 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  4. Linear stability and divisibility gaps for Gaussian maxima
    Chahel Paatur
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  5. Divisibility and torsion in higher Chow groups over arithmetic fields
    Toshiro Hiranouchi, Rin Sugiyama
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@misc{dunkelberg2026seveneighths,
  title = {{One and Seven-Eighths Divisibility Problems of Propp}},
  author = {Aidan Dunkelberg},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.38493},
  eprint = {2609.38493},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.38493},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - One and Seven-Eighths Divisibility Problems of Propp
AU  - Aidan Dunkelberg
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.38493
UR  - https://arxiv.org/abs/2609.38493
AB  - We provide one full solution, and another nearly complete solution, to two problems from Jim Propp's 1999 article "Enumeration of matchings; problems and progress" (namely, Problems 30 and 31) involving divisibility properties of the number of matchings of two non-bipartite triangular graphs. We extend our method of proof of the second problem to show that the number of matchings of any graph composed of tetrahedral cells, such that the number of cells is suitably few relative to the number of vertices, is divisible by a power of 3; in particular, we then exhibit a collection of non-planar graphs whose number of matchings is divisible by 3.
ER  -