Pages that link to "Item:Q616364"
From MaRDI portal
The following pages link to Digraphs that have at most one walk of a given length with the same endpoints (Q616364):
Displaying 17 items.
- Sizes and transmissions of digraphs with a given clique number (Q281810) (← links)
- Maximum size of digraphs with some parameters (Q326498) (← links)
- Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths (Q442298) (← links)
- On the 0-1 matrices whose squares are 0-1 matrices (Q967506) (← links)
- 0-1 matrices with zero trace whose squares are 0-1 matrices (Q1736213) (← links)
- \(\text{TT}_n\)-maximal digraphs of the minimum size (Q1970725) (← links)
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints (Q1999736) (← links)
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints (Q2025066) (← links)
- Extremal digraphs avoiding an orientation of the diamond (Q2042213) (← links)
- A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints (Q2115146) (← links)
- Extremal digraphs avoiding distinct walks of length 3 with the same endpoints (Q2144591) (← links)
- Extremal digraphs avoiding distinct walks of length 4 with the same endpoints (Q2151226) (← links)
- On \(k\)-idempotent 0-1 matrices (Q2174100) (← links)
- 0-1 matrices whose squares have bounded entries (Q2226395) (← links)
- Extremal digraphs avoiding an orientation of \(C_4\) (Q2305933) (← links)
- The Turán number of directed paths and oriented cycles (Q2701405) (← links)
- 0–1 matrices whose <i>k</i>-th powers have bounded entries (Q5132619) (← links)
