English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

We introduce the concept of a clique bitrade, which generalizes several knowntypes of bitrades, including latin bitrades, Steiner $T(k-1,k,v)$ bitrades,extended $1$-perfect bitrades. For a distance-regular graph, we show aone-to-one correspondence between the clique bitrades that meet theweight-distribution lower bound on the cardinality and the bipartite isometricsubgraphs that are distance-regular with certain parameters. As an applicationof the results, we find the minimum cardinality of $q$-ary Steiner$T_q(k-1,k,v)$ bitrades and show a connection of minimum such bitrades withdual polar subgraphs of the Grassmann graph $J_q(v,k)$. Keywords: bitrades,trades, Steiner systems, subspace designs

To the theory of $q$-ary Steiner and other-type trades