Disproof of a conjecture of Erdös and moser on tournaments
From MaRDI portal
Publication:5602692
DOI10.1016/S0021-9800(70)80061-8zbMath0204.24605OpenAlexW1965982884WikidataQ55882929 ScholiaQ55882929MaRDI QIDQ5602692
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80061-8
Related Items
An application of the Ramsey theorem to ordered r-tournaments, Maximum Semiorders in Interval Orders, On the dichromatic number of surfaces, A note on some embedding problems for oriented graphs, Boundedness of optimal matrices in extremal multigraph and digraph problems, The number of edge-disjoint transitive triples in a tournament, A short proof of a theorem of Reid and Parker on tournaments, On tournaments and their largest transitive subtournaments, The 3 and 4-dichromatic tournaments of minimum order, Design and serial construction of digraph braids, The reversing number of a digraph, On the feedback number of 3-uniform linear extremal hypergraphs, Vertex critical 4-dichromatic circulant tournaments, On a problem of Erdős and Rado, Antidirected Hamiltonian circuits in tournaments, The smallest 5-chromatic tournament, Antidirected spanning closed trail in tournaments, Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique, NC algorithms for antidirected hamiltonian paths and cycles in tournaments, Feedback Vertex Sets in Tournaments, Paths with many shortcuts in tournaments, New bounds on the Ramsey number \(r ( I_m , L_n )\), Kernels for feedback arc set in tournaments, A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments, Upper bounds on the size of transitive subtournaments in digraphs, Ramsey numbers for tournaments, Graph theory, Antidirected Hamiltonian paths in tournaments, Internal coverings of sets by asymmetric relations, Tournaments and Semicomplete Digraphs, Some Ramsey nu mbers for directed graphs, Idiosynchromatic poetry, Infinite families of -dichromatic vertex critical circulant tournaments, Decomposing oriented graphs into transitive tournaments
