A Fundamental Matrix Equation for Finite Sets

DOI10.2307/2038366MaRDI QIDQ5672647zbMATH OpenOpenAlexFDO

Authors Herbert John Ryser

Publication date 1972

Full work available at URL https://doi.org/10.2307/2038366

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Matrix equations and identities (15A24)

Cites work

• A problem in partitions
• Block designs with repeated blocks
• Combinatorial Configurations
• scientific article; zbMATH DE number 3563112 (Why is no real title available?)
• Products of Zero-One Matrices

Cited in

(11)

• Properties of (0,1)-matrices with no triangles
• Properties of (0,1)-matrices without certain configurations
• Matrices with forbidden subconfigurations
• General forbidden configuration theorems
• A forbidden configuration theorem of Alon
• A theorem in combinatorial matrix theory
• Matrices and set intersections
• Set intersection matrices
• Analogs of a theorem of Schur on matrix transformations
• Hypergraphs with no special cycles
• Matrices and set differences

This page was built for publication: A Fundamental Matrix Equation for Finite Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672647)