11 research outputs found

    d-cube decompositions of K-n/K-m

    No full text
    Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m

    Zentrales Nervensystem und Sinnesorgane

    No full text

    Semidefinite Bounds

    No full text
    corecore