Boolean rank of upset tournament matrices

DOI10.1016/j.laa.2011.11.003zbMath1241.05068OpenAlexW2075937212MaRDI QIDQ417452

Scott Roy, J. Richard Lundgren, David E. Brown, 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

zbMATH Keywords

tournamentintersection numberBoolean ranktournament matrix

Mathematics Subject Classification ID

Factorization of matrices (15A23) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

The use of Volterra series in the analysis of the nonlinear Schrödinger equation ⋮ The number of tournaments with the minimum number of upsets ⋮ Spatial frequency range analysis for the nonlinear Schrödinger equation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
• Minimum matrix rank of k-regular (0,1) matrices
• Upsets in round robin tournaments
• Semiring rank versus column rank
• Recognizing interval digraphs and interval bigraphs in polynomial time
• Short proofs for interval digraphs
• Score certificate numbers of upset tournaments
• Rank comparisons
• Tournament matrices and their generalizations, I.
• Interval digraphs: An analogue of interval graphs
• Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
• RANK INEQUALITIES OVER SEMIRINGS
• Interval Tournaments
• The Representation of a Graph by Set Intersections
• Boolean rank of Kronecker products

This page was built for publication: Boolean rank of upset tournament matrices