To the theory of q-ary Steiner and other-type trades
From MaRDI portal
Publication:897311
Abstract: We introduce the concept of a clique bitrade, which generalizes several known types of bitrades, including latin bitrades, Steiner bitrades, extended -perfect bitrades. For a distance-regular graph, we show a one-to-one correspondence between the clique bitrades that meet the weight-distribution lower bound on the cardinality and the bipartite isometric subgraphs that are distance-regular with certain parameters. As an application of the results, we find the minimum cardinality of -ary Steiner bitrades and show a connection of minimum such bitrades with dual polar subgraphs of the Grassmann graph . Keywords: bitrades, trades, Steiner systems, subspace designs
Recommendations
- scientific article; zbMATH DE number 1529467
- On the spectrum of Steiner \((v, k, t)\) trades. II
- Existence of \(q\)-analogs of Steiner systems
- scientific article; zbMATH DE number 2192199
- Steiner trade spectra of complete partite graphs
- A new approach for examining \(q\)-Steiner systems
- \(L_p\)-Steiner quermassintegrals
- Subcubic trades in Steiner triple systems
- On \(q\)-analogs of Steiner systems and covering designs
- scientific article; zbMATH DE number 1229628
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 3321827 (Why is no real title available?)
- scientific article; zbMATH DE number 3349875 (Why is no real title available?)
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
- Coding for Errors and Erasures in Random Network Coding
- Combinatorial designs and algebras
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Delsarte clique graphs
- Existence of \(q\)-analogs of Steiner systems
- Large sets of subspace designs
- Multidimensional Latin bitrades
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\)
- On the number of \(n\)-ary quasigroups of finite order.
- On the number of inequivalent steiner triple systems
- On the number of maximum independent sets in Doob graphs
- On the structure of (v,k,t) trades
- On the structure of non-full-rank perfect \(q\)-ary codes
- On weight distributions of perfect colorings and completely regular codes
- Perfect binary codes: constructions, properties, and enumeration
- Switching codes and designs
- The theory and application of latin bitrades: A survey
Cited in
(29)- Minimum supports of eigenfunctions of Johnson graphs
- On eigenfunctions and maximal cliques of Paley graphs of square order
- On the non-existence of some Steiner $t$-$(v,k)$ trades of certain volumes
- On a correspondence between maximal cliques in Paley graphs of square order
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- Minimum supports of functions on the Hamming graphs with spectral constraints
- Large sets of subspace designs
- Inclusion matrices for rainbow subsets
- On existence of perfect bitrades in Hamming graphs
- The extended 1-perfect trades in small hypercubes
- \(PI\)-eigenfunctions of the Star graphs
- The minimum volume of subspace trades
- On eigenfunctions and maximal cliques of generalised Paley graphs of square order
- Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph
- On the cardinality spectrum and the number of Latin bitrades of order 3
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
- Optimal functions with spectral constraints in hypercubes
- Extremal Peisert-type graphs without the strict-EKR property
- Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
- On extended 1-perfect bitrades
- MMS-type problems for Johnson scheme
- Minimum supports of eigenfunctions of graphs: a survey
- A new series of large sets of subspace designs over the binary field
- On completely regular codes with minimum eigenvalue in geometric graphs
- Minimum supports of eigenfunctions in bilinear forms graphs
- Minimum supports of eigenfunctions of Hamming graphs
- Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
- Minimal solutions of the isometry equation
- Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
This page was built for publication: To the theory of \(q\)-ary Steiner and other-type trades
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897311)