Digraphs that have at most one walk of a given length with the same endpoints
From MaRDI portal
Publication:616364
DOI10.1016/j.disc.2010.09.025zbMath1225.05115OpenAlexW1997313996MaRDI QIDQ616364
Publication date: 7 January 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.09.025
Related Items (16)
Sizes and transmissions of digraphs with a given clique number ⋮ Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ Maximum size of digraphs with some parameters ⋮ Extremal digraphs avoiding distinct walks of length 4 with the same endpoints ⋮ On \(k\)-idempotent 0-1 matrices ⋮ Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths ⋮ The Turán number of directed paths and oriented cycles ⋮ 0–1 matrices whose k-th powers have bounded entries ⋮ 0-1 matrices whose squares have bounded entries ⋮ 0-1 matrices with zero trace whose squares are 0-1 matrices ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints ⋮ On the 0-1 matrices whose squares are 0-1 matrices ⋮ 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
This page was built for publication: Digraphs that have at most one walk of a given length with the same endpoints
