Bipartite Steinhaus graphs (Q5970365)

Let \(A_{ij}\) be a binary triangle with base \(a_{1j}\), \(1\leq j\leq n\) such that \(a_{ij}=a_{i-1,j-1}+a_{i-1,j}\) for \(1<i\leq n\). Such triangle is called a Steinhaus triangle. Considering a Steinhaus triangle as the upper triangle of a symmetric matrix with a zero diagonal, we obtain a Steinhaus graph. In this paper are presented two results concerning the bipartite Steinhaus graphs. At first the bipartite Steinhaus graph is characterised as a Steinhaus graph without triangles. The second result is that a Steinhaus bipartite graph with vertex partition \(| X| \leq | Y|\) has X-saturated matching.