Birkbeck Institutional Research Online
metadata only
Strong external difference families and classification of α-valuations
One method of constructing (a2 + 1, 2, a, 1)-SEDFs (i.e., strong external difference families) in Za2+1 makes use of α-valuations of complete bipartite graphs Ka,a. We explore this approach and we provide a classification theorem which shows that all such α-valuations can be constructed recursively
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
- A Counterexample to Teschner's Bondage-Number Conjecture#927557
- The Erdős-Hajnal Property for the six-vertex Graph with Edge Set $\{ab,bc,cd,de,af,bf,df\}$#792548
- The Erdős-Hajnal Property for the six-vertex Graph with Edge Set $\{ab,bc,cd,de,af,bf,df\}$#788548
- Tilikum: Transaction Fair Ordering on a DAG without Weak Edges#310731
- A short proof that $R(3,k)=Θ(k^2/\log k)$#822209
Record · ID 1161146
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