On directed local chromatic number, shift graphs, and Borsuk-like graphs

DOI10.1002/jgt.20494zbMath1222.05076arXiv0906.2897MaRDI QIDQ3067063

Gábor Tardos, Gábor Simonyi

Publication date: 20 January 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.2897

zbMATH Keywords

topological method; shift graph; local chromatic number; Schrijver graph

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

Related Items

Relations between the Local Chromatic Number and Its Directed Version, Dynamic coloring of graphs having no \(K_5\) minor, The fractional version of Hedetniemi's conjecture is true, Coloring chains for compression with uncertain priors, Resource-sharing system scheduling and circular chromatic number

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Inequalities for two set systems with prescribed intersections
• An extremal problem for two families of sets
• Evenly distributed subsets of \(S^ n\) and a combinatorial application
• Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
• Fractional chromatic numbers of cones over graphs
• Local chromatic number and distinguishing the strength of topological obstructions
• On products of idempotent matrices
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item