2000 character limit reached
A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
Published 23 Oct 2025 in math.CO and cs.DS | (2510.20744v1)
Abstract: Ferrer dimension, along with the order dimension, is a standard dimensional concept for bipartite graphs. In this paper, we prove that a graph is of Ferrer dimension three (equivalent to the intersection bigraph of orthants and points in ${\mathbb R}3$) if and only if it admits a biadjacency matrix representation that does not contain $\Gamma= \begin{bmatrix} * & 1 & * \ 1 & 0 & 1 \ 0 & 1 & * \end{bmatrix}$ and $\Delta = \begin{bmatrix} 1 & * & * \ 0 & 1 & * \ 1 & 0 & 1 \end{bmatrix}$, where $*$ denotes zero or one entry.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.