Pages that link to "Item:Q1343231"
From MaRDI portal
The following pages link to On tournaments and their largest transitive subtournaments (Q1343231):
Displaying 12 items.
- Largest digraphs contained in all n-tournaments (Q788740) (← links)
- Tiling transitive tournaments and their blow-ups (Q1425167) (← links)
- Upper bounds on the size of transitive subtournaments in digraphs (Q2013188) (← links)
- Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth (Q2094884) (← links)
- New bounds on the Ramsey number \(r ( I_m , L_n )\) (Q2222964) (← links)
- On the restricted isometry property of the Paley matrix (Q2238859) (← links)
- Tighter bounds on directed Ramsey number \(R(7)\) (Q2676760) (← links)
- A note on some embedding problems for oriented graphs (Q2891043) (← links)
- Transitive convex subsets in large tournaments (Q3439377) (← links)
- Design and serial construction of digraph braids (Q3453872) (← links)
- (Q3768925) (← links)
- On interval colouring reorientation number of oriented graphs (Q6648249) (← links)
