On a problem of Yuzvinsky on separating the n-cube

DOI10.1016/0012-365X(86)90013-0zbMATH Open0645.05064OpenAlexW2085562170MaRDI QIDQ1102986FDOQ1102986

Daniel J. Kleitman

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90013-0

zbMATH Keywords

vertex removaln-cubeantipodal pair of vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Extremal problems for finite sets and convex hulls---a survey
• Discrete Isoperimetric Problems

Cited In (7)

• Title not available (Why is that?)
• On sequential diagnosis of multiprocessor systems
• On diagnosability of large multiprocessor networks
• On approximation of asymmetric separators of the \(n\)-cube
• On dissections of the n-cube
• An algorithm to generate tournament score sequences
• Hypercube sandwich approach to conferencing.

   Recommendations

• Partitioning the \(n\)-cube into sets with mutual distance 1 👍 👎
• Matchings and paths in the cube 👍 👎
• The cardinality of the separated vertex set of a multidimensional cube 👍 👎
• Covering the cube by affine hyperplanes 👍 👎
• Feed-forward neural networks: a geometrical perspective 👍 👎

This page was built for publication: On a problem of Yuzvinsky on separating the n-cube

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