Koc University Digital Collections
metadata only
Resolvable 3-star designs
Let K-v be the complete graph of order v and F be a set of 1-factors of K-v. In this article we study the existence of a resolvable decomposition of K-v - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1-factors, with the
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
- Distinguishing adjacent vertices by ordering edges#999514
- Boolean building set arrangements#1036263
- The Most Informative Bit and Beyond: A Proof of the Courtade--Kumar Conjecture and Multibit Extensions#1062336
- 4 Tends not to be true#961250
- 4 Tends not to be true#961245
Record · ID 955113
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