Tournaments and colouring
From MaRDI portal
Publication:1932469
DOI10.1016/j.jctb.2012.08.003zbMath1254.05064OpenAlexW2014815060WikidataQ106009341 ScholiaQ106009341MaRDI QIDQ1932469
Jacob Fox, Krzysztof Choromanski, Maria Chudnovsky, Eli Berger, Alexander D. Scott, P. D. Seymour, Martin Loebl, Steéphan Thomassé
Publication date: 18 January 2013
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2012.08.003
Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Directed graphs (digraphs), tournaments (05C20)
Related Items
Strong complete minors in digraphs, Heroes in Orientations of Chordal Graphs, Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem, Structure Theorem forU5-free Tournaments, Complete directed minors and chromatic number, Extending the Gyárfás-Sumner conjecture, Excluding pairs of graphs, On coloring digraphs with forbidden induced subgraphs, Pure pairs. X. Tournaments and the strong Erdős-Hajnal property, The removal lemma for tournaments, Unavoidable tournaments, Acyclic coloring of products of digraphs, Biased orientation games, Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\), Heroes in oriented complete multipartite graphs, Large Unavoidable Subtournaments, DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER, Tournaments with near-linear transitive subsets, Coloring digraphs with forbidden cycles, Domination in tournaments, The edge density of critical digraphs, A tournament approach to pattern avoiding matrices, Coloring dense digraphs, The diachromatic number of digraphs, Coloring tournaments: from local to global, Tournaments and Semicomplete Digraphs, Forcing large transitive subtournaments, EH-suprema of tournaments with no nontrivial homogeneous sets, The Erdös-Hajnal Conjecture-A Survey, Topology of acyclic complexes of tournaments and coloring
