𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of hypercubic bipartitions of an integer

✍ Scribed by Agnarsson, Geir

Book ID
121315945
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
400 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Achromatic Number of Hypercubes
On the Achromatic Number of Hypercubes
✍ Yuval Roichman πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 96 KB

The achromatic number of a finite graph G, (G), is the maximum number of independent sets into which the vertex set may be partitioned, so that between any two parts there is at least one edge. For an m-dimensional hypercube P m 2 we prove that there exist constants 0<c 1 <c 2 , independent of m, su

On the queue-number of the hypercube
On the queue-number of the hypercube
✍ Petr Gregor; Riste Ε krekovski; Vida VukaΕ‘inoviΔ‡ πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 180 KB
On the bipartite independence number of
On the bipartite independence number of a balanced bipartite graph
✍ Odile Favaron; Pedro Mago; Oscar Ordaz πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

An improved upper bound on the crossing
An improved upper bound on the crossing number of the hypercube
✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej SΓ½kora; Imrich Vrt' πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of ErdΓΆs and Guy. Β© 2008 Wiley Periodicals, Inc. J Graph