scientific article; zbMATH DE number 3695201

MaRDI QIDQ3889062zbMATH OpenFDO

Authors L. A. Aslanyan

Publication date 1979

zbMATH Keywords

binary group codesdiscrete isoperimetric problemlayersmaximum number of cliquesminimum covering of a setminimum testSperner systemsunit cube

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited in

(4)

• Numerical characterization of \(n\)-cube subset partitioning
• The splitting technique in monotone recognition
• On diagnosability of large multiprocessor networks
• Discrete tomography problems with paired projections and complexity characteristics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3889062)