Conceptio › Archive › Koc University Digital Collections
Koc University Digital Collections metadata only

Maximum uniformly resolvable decompositions of K-v and K-v - I into 3-stars and 3-cycles

Koc University Digital Collections · Papers
Open Source ↗
applied-mathematicsmathematics
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

Record · ID 955112
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