Koc University Digital Collections
metadata only
The number of common flowers of two STS (v)s and embeddable Steiner triple trades
A flower, F-s(x), around a point x in a Steiner triple system D = (V, B) is the set of all triples in B which contain the point x, namely F-D(X)={b is an element of B vertical bar x is an element of b}. This paper determines the possible number of common flowers that two Steiner triple systems can h
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
- Counting edge-colorings of a complete graph avoiding a rainbow $K_4$#1048924
- Solitude patterns of $r$-graphs via CLM's dependence relation#821665
- The crossing number and the unit-distance crossing number of the Hamming graphs H(d,3)=K_3^{box d}, and their realizations over many coordinate fields#1083260
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- Acyclic and oriented chromatic numbers of graphs#490219
Record · ID 954706
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