Digital Commons @ Michigan Tech
metadata only
41 is the Largest Size of a Cap in PG(4,4)
We settle the question of the maximal size of caps in PG(4, 4), with the help of a computer program.
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
- Vizing's theorem for signed multigraphs#1117820
- Crown graphs maximise the representation number of bipartite graphs#1130684
- Fixed-Perimeter Franklin Statistics and an Eventual Inequality#999985
- The integrability of sesqui-regular graphs with smallest eigenvalue at least $-3$#1064244
- Diameter Base Protocol#218426
Record · ID 921556
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