Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3695201

From MaRDI portal
Publication:3889062
Jump to:navigation, search

zbMATH Open0445.05020MaRDI QIDQ3889062FDOQ3889062


Authors: L. A. Aslanyan Edit this on Wikidata


Publication date: 1979



Title of this publication is not available (Why is that?)




zbMATH Keywords

layersSperner systemsunit cubediscrete isoperimetric problemmaximum number of cliquesbinary group codesminimum covering of a setminimum test


Mathematics Subject Classification ID

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



Cited In (3)

  • Numerical characterization of \(n\)-cube subset partitioning
  • On diagnosability of large multiprocessor networks
  • The splitting technique in monotone recognition





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3889062&oldid=17525695"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 19:27. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki