Pages that link to "Item:Q1393032"
From MaRDI portal
The following pages link to On tournaments free of large transitive subtournaments (Q1393032):
Displayed 15 items.
- A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments (Q960957) (← links)
- The number of edge-disjoint transitive triples in a tournament (Q1886364) (← 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)
- On the dichromatic number of surfaces (Q2121762) (← 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)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Infinite families of -dichromatic vertex critical circulant tournaments (Q3439577) (← links)
- Design and serial construction of digraph braids (Q3453872) (← links)
- Semidefinite Programming and Ramsey Numbers (Q5163505) (← links)
- Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree (Q5854457) (← links)
- The smallest 5-chromatic tournament (Q6076253) (← links)