𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum number of edges joining vertices on a cube

✍ Scribed by Khaled A.S. Abdel-Ghaffar

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
84 KB
Volume
87
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

Let E d (n) be the number of edges joining vertices from a set of n vertices on a d-dimensional cube, maximized over all such sets. We show that E d (n) = r-1 i=0 (l i /2 + i)2 l i , where r and l 0 > l 1 > β€’ β€’ β€’ > l r-1 are nonnegative integers defined by n = r-1 i=0 2 l i .

πŸ“œ SIMILAR VOLUMES

On the effect of major vertices on the n
On the effect of major vertices on the number of light edges
✍ Sanders, Daniel P. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 423 KB πŸ‘ 2 views

This paper presents an inequality satisfied by planar graphs of minimum degree five. For the purposes of this paper, an edge of a graph is light if the weight of the edge, or the sum of the degrees of the vertices incident with it, is at most eleven. The inequality presented shows that planar graph

The number of edges in a maximum cycleβ€”d
The number of edges in a maximum cycleβ€”distributed graph
✍ Yongbing Shi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 288 KB

Shi, Y., The number of edges in a maximum cycle-distributed graph, Discrete Mathematics 104 (1992) 205-209. Let f(n) (f\*(n)) be the maximum possible number of edges in a graph (2-connected simple graph) on n vertices in which no two cycles prove that, for every integer n > 3, f(n) 3 n + k + [i( [~(

A note on the edges of the n-cube
A note on the edges of the n-cube
✍ Sergiu Hart πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 671 KB

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,