Embedding perfectly balanced 2-caterpillar into its optimal hypercube

10/12/2021
by   Rishikant Rajdeepak, et al.
0

A long-standing conjecture on spanning trees of a hypercube states that a balanced tree on 2^n vertices with maximum degree at most 3 spans the hypercube of dimension n <cit.>. In this paper, we settle the conjecture for a special family of binary trees. A 0-caterpillar is a path. For k≥ 1, a k-caterpillar is a binary tree consisting of a path with j-caterpillars (0≤ j≤ k-1) emanating from some of the vertices on the path. A k-caterpillar that contains a perfect matching is said to be perfectly balanced. In this paper, we show that a perfectly balanced 2-caterpillar on 2^n vertices spans the hypercube of dimension n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2021

Every Steiner triple system contains an almost spanning d-ary hypertree

In this paper we make a partial progress on the following conjecture: fo...
research
03/24/2023

Sharp threshold for embedding balanced spanning trees in random geometric graphs

A rooted tree is balanced if the degree of a vertex depends only on its ...
research
06/22/2018

Improved bounds for multipass pairing heaps and path-balanced binary search trees

We revisit multipass pairing heaps and path-balanced binary search trees...
research
07/09/2021

Staged tree models with toric structure

A staged tree model is a discrete statistical model encoding relationshi...
research
06/30/2022

Growth and irreducibility in path-incompressible trees

We study effective randomness-preserving transformations of path-incompr...
research
06/10/2023

List homomorphisms to separable signed graphs

The complexity of the list homomorphism problem for signed graphs appear...
research
03/27/2018

The balanced 2-median and 2-maxian problems on a tree

This paper deals with the facility location problems with balancing on a...

Please sign up or login with your details

Forgot password? Click here to reset