Koc University Digital Collections
metadata only
Maximum uniformly resolvable decompositions of K-v and K-v - I into 3-stars and 3-cycles
Let K-v denote the complete graph of order v and K-v - I denote K-v minus a 1-factor. In this article we investigate uniformly resolvable decompositions of K-v and K-v - I into r classes containing only copies of 3-stars and s classes containing only copies of 3-cycles. We completely determine the s
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
- Towards stratified sampling for redistricting plans#1012908
- Robust Reconstruction on Trees with a Growing Alphabet#1117975
- The graph reconstruction number#490175
- From the Lagrange Triangle to the Figure Eight Choreography: Proof of Marchal's Conjecture#1144695
- A Tight Erdős-Stone Bound for All Graph Densities#821533
Record · ID 955112
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