Dense sets and embedding trees into hypercubes.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F01%3A00105722" target="_blank" >RIV/00216208:11320/01:00105722 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Dense sets and embedding trees into hypercubes.
Original language description
The idea of dense sets in the hypercube is explored to give partial results supporting a conjecture of Bhatt and Ipsen on embedding binary trees into hypercubes.
Czech name
—
Czech description
—
Classification
Type
V<sub>x</sub> - Unclassified - Research report containing classified information
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F98%2F1451" target="_blank" >GA201/98/1451: Special graph, hypergraph and algorithmic structures</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Number of pages
6
Place of publication
Praha
Publisher/client name
KSVI MFF UK
Version
—