Pages that link to "Item:Q5602692"
From MaRDI portal
The following pages link to Disproof of a conjecture of Erdös and moser on tournaments (Q5602692):
Displayed 21 items.
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Decomposing oriented graphs into transitive tournaments (Q817766) (← links)
- A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments (Q960957) (← links)
- An application of the Ramsey theorem to ordered r-tournaments (Q1077436) (← links)
- A short proof of a theorem of Reid and Parker on tournaments (Q1343229) (← links)
- On tournaments and their largest transitive subtournaments (Q1343231) (← links)
- The 3 and 4-dichromatic tournaments of minimum order (Q1343264) (← links)
- Vertex critical 4-dichromatic circulant tournaments (Q1363679) (← links)
- On a problem of Erdős and Rado (Q1387613) (← links)
- Antidirected Hamiltonian circuits in tournaments (Q1394234) (← links)
- Some Ramsey nu mbers for directed graphs (Q1846431) (← links)
- The number of edge-disjoint transitive triples in a tournament (Q1886364) (← links)
- The reversing number of a digraph (Q1894351) (← links)
- Boundedness of optimal matrices in extremal multigraph and digraph problems (Q2367447) (← links)
- Internal coverings of sets by asymmetric relations (Q2554697) (← links)
- A note on some embedding problems for oriented graphs (Q2891043) (← links)
- Infinite families of -dichromatic vertex critical circulant tournaments (Q3439577) (← links)
- Maximum Semiorders in Interval Orders (Q3963053) (← links)
- Graph theory (Q5917392) (← links)
- Antidirected Hamiltonian paths in tournaments (Q5921444) (← links)
- Ramsey numbers for tournaments (Q5941503) (← links)