Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Factorization of matrices (15A23) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Local out-tournaments with upset tournament strong components I: full and equal \(\{0,1\}\)-matrix ranks.
- Isolation number versus Boolean rank in tournaments
- scientific article; zbMATH DE number 436068
- The Ranks of Tournament Matrices
- The Boolean rank of the uniform intersection matrix and a family of its submatrices
Cites work
- scientific article; zbMATH DE number 4008576 (Why is no real title available?)
- scientific article; zbMATH DE number 3781471 (Why is no real title available?)
- Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
- Boolean rank of Kronecker products
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Interval Tournaments
- Interval digraphs: An analogue of interval graphs
- Local out-tournaments with upset tournament strong components I: full and equal \(\{0,1\}\)-matrix ranks.
- Minimum matrix rank of k-regular (0,1) matrices
- RANK INEQUALITIES OVER SEMIRINGS
- Rank comparisons
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Score certificate numbers of upset tournaments
- Semiring rank versus column rank
- Short proofs for interval digraphs
- The Representation of a Graph by Set Intersections
- Tournament matrices and their generalizations, I.
- Upsets in round robin tournaments
Cited in
(8)- scientific article; zbMATH DE number 5016661 (Why is no real title available?)
- Spatial frequency range analysis for the nonlinear Schrödinger equation
- scientific article; zbMATH DE number 1990694 (Why is no real title available?)
- Local out-tournaments with upset tournament strong components I: full and equal \(\{0,1\}\)-matrix ranks.
- scientific article; zbMATH DE number 436068 (Why is no real title available?)
- The number of tournaments with the minimum number of upsets
- The use of Volterra series in the analysis of the nonlinear Schrödinger equation
- Isolation number versus Boolean rank in tournaments
This page was built for publication: Boolean rank of upset tournament matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417452)
