A note on the edges of the n-cube
โ Scribed by Sergiu Hart
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 671 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The following combinatorial problem, which arose in game theory, is solved here: To tind a selt of vertices of ;P given size (in t.k nxube) which has a maximal number sf interconnecting edges,
๐ SIMILAR VOLUMES
Chen, W.Y.C. and R.P. Stanley, Derangements on the n-cube, Discrete Mathematics 115 (1993) 65-15. Let Q. be the n-dimensional cube represented by a graph whose vertices are sequences of O's and l's of length n, where two vertices are adjacent if and only if they differ only at one position. A k-dime
The following problem of Yuzvinsky is solved here: how many vertices of the n-cube must be removed from it in order that no connected component of the rest contains an antipodal pair of vertices? Some further results and problems are described as well.
In this paper we present a method for analyzing a general class of random ## ลฝ . walks on the n-cube and certain subgraphs of it . These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bound
## lhc mctJiotl of mnniifiicturing Iiicqiicr is as follows : The resin is pliicctl in :i copl)cr-bot.toiiictl pot over ii giis or fuel-oil firr rind houglit up to tlic required tcmpcraturc~. Aftrr ii ccrtiiin tlcgrcc of liqucficiition hirs becn rciichctl t he oil is nddctl. Continuiil stirring is
Let G be a 2-edge connected graph with a t least 5 vertices. For any given vertices a, b, c, and din G with a # b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 U {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Al