Decomposing the hypercube Qn into n isomorphic edge-disjoint trees
- Wagner, Stephan
- Wild, Marcel
DOIAbstract
AbstractWe show that the edge set of the n-dimensional hypercube Qn is the disjoint union of the edge sets of n isomorphic trees
AbstractWe show that the edge set of the n-dimensional hypercube Qn is the disjoint union of the edge sets of n isomorphic trees
AbstractWe prove that every 3-uniform hypergraph with q edges contain two edge disjoint isomorphic s...
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition sim...
The hypercube Q_n is the graph whose vertex set is {0, 1}^n and where two vertices are adjacent if t...
AbstractWe show that the edge set of the n-dimensional hypercube Qn is the disjoint union of the edg...
We consider edge decompositions of the n-dimensional hypercube Q$_{n}$ into isomorphic copies of a g...
AbstractA long standing conjecture of Havel (1984) [10] states that every equipartite tree with maxi...
AbstractWe give upper and lower bounds to the number un− (Qn) of edges that one can remove from a hy...
AbstractIt is shown that the size of any C4k+2-free subgraph of the hypercube Qn, k⩾3, is o(e(Qn))
We show that any k‐uniform hypergraph with n edges contains two isomorphic edge disjoint subgraphs o...
AbstractThe aim of this paper is to prove that certain trees are spanning trees of the hypercube Qn....
We show that the complete binary tree with n > 8 leaves can be embedded in the hypercube with n node...
AbstractLet H be a tree on h⩾2 vertices. It is shown that if n is sufficiently large and G=(V, E) is...
AbstractFor n = 2k − 1 we prove, via a counting argument, that for any tree J with vertex set T, if ...
AbstractAn isometric path is merely any shortest path between two vertices. If the vertices of the h...
AbstractWe describe dense edge-disjoint embeddings of the complete binary tree with n leaves in the ...
AbstractWe prove that every 3-uniform hypergraph with q edges contain two edge disjoint isomorphic s...
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition sim...
The hypercube Q_n is the graph whose vertex set is {0, 1}^n and where two vertices are adjacent if t...
AbstractWe show that the edge set of the n-dimensional hypercube Qn is the disjoint union of the edg...
We consider edge decompositions of the n-dimensional hypercube Q$_{n}$ into isomorphic copies of a g...
AbstractA long standing conjecture of Havel (1984) [10] states that every equipartite tree with maxi...
AbstractWe give upper and lower bounds to the number un− (Qn) of edges that one can remove from a hy...
AbstractIt is shown that the size of any C4k+2-free subgraph of the hypercube Qn, k⩾3, is o(e(Qn))
We show that any k‐uniform hypergraph with n edges contains two isomorphic edge disjoint subgraphs o...
AbstractThe aim of this paper is to prove that certain trees are spanning trees of the hypercube Qn....
We show that the complete binary tree with n > 8 leaves can be embedded in the hypercube with n node...
AbstractLet H be a tree on h⩾2 vertices. It is shown that if n is sufficiently large and G=(V, E) is...
AbstractFor n = 2k − 1 we prove, via a counting argument, that for any tree J with vertex set T, if ...
AbstractAn isometric path is merely any shortest path between two vertices. If the vertices of the h...
AbstractWe describe dense edge-disjoint embeddings of the complete binary tree with n leaves in the ...
AbstractWe prove that every 3-uniform hypergraph with q edges contain two edge disjoint isomorphic s...
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition sim...
The hypercube Q_n is the graph whose vertex set is {0, 1}^n and where two vertices are adjacent if t...
Add to ORKG