English

A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three

Combinatorics 2025-10-24 v1 Data Structures and Algorithms

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 R3{\mathbb R}^3) if and only if it admits a biadjacency matrix representation that does not contain Γ=[110101]\Gamma= \begin{bmatrix} * & 1 & * \\ 1 & 0 & 1 \\ 0 & 1 & * \end{bmatrix} and Δ=[101101]\Delta = \begin{bmatrix} 1 & * & * \\ 0 & 1 & * \\ 1 & 0 & 1 \end{bmatrix}, where * denotes zero or one entry.

Keywords

Cite

@article{arxiv.2510.20744,
  title  = {A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three},
  author = {Parinya Chalermsook and Ly Orgo and Minoo Zarsav},
  journal= {arXiv preprint arXiv:2510.20744},
  year   = {2025}
}