Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices

DOI10.1016/J.DISC.2012.04.019zbMath1246.05010arXiv1107.1299OpenAlexW1974553375MaRDI QIDQ442351

Hyeong-Kwan Ju, Seung-Hyun Seo

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.1299

zbMATH Keywords

bipartite graphpattern avoiding matrix

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (4)

Bijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matrices ⋮ Lonesum decomposable matrices ⋮ On finitary properties for fiber products of free semigroups and free monoids ⋮ Structured preferences: a literature survey

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Poly-Bernoulli numbers
• Efficient graph representations
• On the Lambert \(w\) function
• Permuting matrices to avoid forbidden submatrices
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• Nonredundant 1’s in $\Gamma $-Free Matrices

This page was built for publication: Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices