Maximum and minimum jump number of posets from matrices
From MaRDI portal
Publication:1194526
DOI10.1016/0024-3795(92)90030-EzbMath0755.05016MaRDI QIDQ1194526
Richard A. Brualdi, Hyung Chan Jung
Publication date: 27 September 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
06A07: Combinatorics of partially ordered sets
Related Items
Cites Work
- Unnamed Item
- On the minimum rank of regular classes of matrices of zeros and ones
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- Transversal theory. An account of some aspects of combinatorial mathematics
- A decomposition theorem for partially ordered sets
- The Jump Number of Dags and Posets: An Introduction
- Minimizing Setups for Cycle-Free Ordered Sets