0–1 matrices whose k-th powers have bounded entries

DOI10.1080/03081087.2019.1567671zbMath1455.15008OpenAlexW2910944725WikidataQ114641304 ScholiaQ114641304MaRDI QIDQ5132619

Zhenhua Lyu, Ze-Jun Huang

Publication date: 12 November 2020

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2019.1567671

zbMATH Keywords

digraphtournamentwalk0-1 matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Matrices of integers (15B36) Boolean and Hadamard matrices (15B34)

Related Items (6)

Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ Extremal digraphs avoiding distinct walks of length 4 with the same endpoints ⋮ Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints ⋮ Extremal digraphs avoiding an orientation of the diamond ⋮ Extremal digraphs avoiding an orientation of \(C_4\) ⋮ A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints

Cites Work

• Digraphs that have at most one walk of a given length with the same endpoints
• On the 0-1 matrices whose squares are 0-1 matrices
• A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
• Unnamed Item

This page was built for publication: 0–1 matrices whose k-th powers have bounded entries