A necessary condition on minimal cube numberings

DOI10.2307/3212033zbMath0173.21203OpenAlexW2331153890MaRDI QIDQ5560774

Lawrence H. Harper

Publication date: 1967

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3212033

Mathematics Subject Classification ID

Graph theory (05Cxx)

Related Items

Boolean functions: influence, threshold and noise, Edge isoperimetric theorems for integer point arrays, Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees, A randomized algorithm for 3-SAT, The global theory of paths in networks. I: Definitions, examples and limits, The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs, Optimal Numberings of an $N \times N$ Array