arXiv (All)
open access
Paley-type matrices and $1$-factorizations of complete graphs
Ball, Ortega--Moreno, and Prodromou asked two questions about whether, for every odd prime $p$, one can find a $1$-factor of the complete graph $K_{p+1}$ with some arithmetic restrictions related to quadratic residues. These problems are motivated by two natural compatibility conditions between $1$-
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
- The Gao-Zhuang conjecture for the Heisenberg group over $\mathbb{F}_p$#973334
- Kolyvagin's conjecture at non-ordinary primes#1070587
- Premaniplexes of rank $3$ and $4$ as symmetry type graphs of maniplexes#1070589
- Eventual Nonnegativity of a Matrix Is in P#1050031
- On a conjecture concerning antipodal labelings for cycles#1077406
Record · ID 820334
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