arXiv (All)
open access
One and Seven-Eighths Divisibility Problems of Propp
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 ext
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Near-Optimal Linear Range for the Erdős Matching Conjecture#985218
- A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph#1036437
- A counterexample to the quantum Hedetniemi conjecture#1034490
- Contribution à l'étude de quelques problèmes de coloration de graphes#370924
- A Hajnal-Szemerédi Theorem for Skewed Colorings#1012804
Record · ID 1143094
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive