Related papers: Hypercube orientations with only two in-degrees

Let $n, s$ be positive integers such that $n$ is sufficiently large and $s\le n/3$. Suppose $H$ is a 3-uniform hypergraph of order $n$. If $H$ contains no isolated vertex and $deg(u)+ deg(v) > 2(s-1)(n-1)$ for any two vertices $u$ and $v$…

Given an integer $1\leq j <n$, define the $(j)$-coloring of a $n$-dimensional hypercube $H_{n}$ to be the $2$-coloring of the edges of $H_{n}$ in which all edges in dimension $i$, $1\leq i \leq j$, have color $1$ and all other edges have…

Faulty networks are useful because link or node faults can occur in a network. This paper examines the Hamiltonian properties of hypercubes under certain conditional faulty edges. Let consider the hypercube \( Q_n \), for \( n \geq 5 \) and…

We consider hypercubes with pairwise disjoint faulty edges. An $n$-dimensional hypercube $Q_n$ is an undirected graph with $2^n$ nodes, each labeled with a distinct binary strings of length $n$. The parity of the vertex is 0 if the number…

The hypercube is one of the most popular interconnection networks since it has simple structure and is easy to implement. The $n$-dimensional twisted cube, denoted by $TQ_n$, an important variation of the hypercube, possesses some…

We prove that at least $\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the…

The hypercube Q_n is the graph whose vertex set is {0,1}^n and where two vertices are adjacent if they differ in exactly one coordinate. For any subgraph H of the cube, let ex(Q_n, H) be the maximum number of edges in a subgraph of Q_n…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

If $n$ is even, the $n$-dimensional hypercube can be decomposed into edge-disjoint cycles of length $2^i$ for every value of $i$ from $2$ to $n$.

Consider the $n$-cube graph with vertices $\{-1,1\}^n$ and edges connecting vertices with hamming distance $1$. How many hyperplanes in $\mathbb{R}^n$ are needed in order to dissect all edges? We show that at least…

Let $n\geq 2$ be an integer, and let $i\in\{0,...,n-1\}$. An $i$-th dimension edge in the $n$-dimensional hypercube $Q_n$ is an edge ${v_1}{v_2}$ such that $v_1,v_2$ differ just at their $i$-th entries. The parity of an $i$-th dimension…

In this paper we study the maximum number of hyperedges which may be in an $r$-uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of length $k$ between them. When $r=t=2$, this is the even-cycle…

We consider two types of problems: maximising, over subsets $S\subseteq \{0,1\}^n$, the density of $d$-subcubes $C$ in the $n$-hypercube graph that span a subgraph such that $S\cap C$ is i) isomorphic to the given configuration…

The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. Zhou et al. [Inform. Sci. 300 (2015) 20-27] proposed an interesting problem that whether there is a fault-free Hamiltonian cycle in $BH_n$ with each vertex incident to at…

In this note we study the distribution of real inflection points among the ovals of a real non-singular hyperbolic curve of even degree. Using Hilbert's method we show that for any integers $d$ and $r$ such that $4\leq r \leq 2d^2-2d$,…

The degree-constrained subgraph problem asks for a subgraph of a given graph such that the degree of each vertex is within some specified bounds. We study the following reconfiguration variant of this problem: Given two solutions to a…

Let $f: E \mapsto \{1,2,\dots,k\}$ be an edge coloring of the $n$ - dimensional hypercube $H_n$. By the palette at a vertex $v$ we mean the sequence $\left(f(e_1(v)), f(e_1(v)),\dots, f(e_n(v))\right)$, where $e_i(v)$ is the $i$ -…

We consider the question of when the $n$-dimensional hypercube can be decomposed into paths of length $k$. Mollard and Ramras \cite{MR2013} noted that for odd $n$ it is necessary that $k$ divides $n2^{n-1}$ and that $k\leq n$. Later, Anick…

In this article we investigate the existence of (2,3)-cordial labelings of oriented hypercubes. In this investigation, we determine that there exists a (2,3)-cordial oriented hypercube for any dimension divisible by 3. Next, we provide…

The middle levels conjecture asserts that there is a Hamiltonian cycle in the middle two levels of $2k+1$-dimensional hypercube. The conjecture is known to be true for $k \leq 17$ [I.Shields, B.J.Shields and C.D.Savage, Disc. Math., 309,…