Boolean rank of upset tournament matrices
DOI10.1016/J.LAA.2011.11.003zbMATH Open1241.05068OpenAlexW2075937212MaRDI QIDQ417452FDOQ417452
Authors: David E. Brown, Scott Roy, J. Richard Lundgren, Daluss J. Siewert 
Publication date: 14 May 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.11.003
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
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)
Cites Work
- Interval digraphs: An analogue of interval graphs
- Semiring rank versus column rank
- RANK INEQUALITIES OVER SEMIRINGS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
- Minimum matrix rank of k-regular (0,1) matrices
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Short proofs for interval digraphs
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Interval Tournaments
- Upsets in round robin tournaments
- Score certificate numbers of upset tournaments
- Rank comparisons
- Local out-tournaments with upset tournament strong components I: full and equal \(\{0,1\}\)-matrix ranks.
- Tournament matrices and their generalizations, I.
- The Representation of a Graph by Set Intersections
- Boolean rank of Kronecker products
Cited In (8)
- Title not available (Why is that?)
- Spatial frequency range analysis for the nonlinear Schrödinger equation
- Title not available (Why is that?)
- Local out-tournaments with upset tournament strong components I: full and equal \(\{0,1\}\)-matrix ranks.
- Title not available (Why is that?)
- 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)
