Drawing a Graph in a Hypercube

Simple item page
dc.creatorWood, David R.
dc.date2005-09-20
dc.date.accessioned2026-07-07T06:33:53Z
dc.date.available2026-07-07T06:33:53Z
dc.descriptionA $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions in hypercube drawing of a given graph. This parameter turns out to be related to Sidon sets and antimagic injections.
dc.descriptionSubmitted
dc.identifierhttps://arxiv.org/abs/math/0509455
dc.identifierhttp://arxiv.org/abs/math/0509455
dc.identifierThe Electronic Journal of Combinatorics, 13(1):R73, 2006.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/99345
dc.subjectCombinatorics
dc.titleDrawing a Graph in a Hypercube
dc.typetext

Files

Collections

arXiv