Coloring graphs with locally few colors
From MaRDI portal
Publication:1074595
DOI10.1016/0012-365X(86)90065-8zbMath0591.05030WikidataQ105741804 ScholiaQ105741804MaRDI QIDQ1074595
Seress, Ákos, Vojtěch Rödl, Péter Komjáth, Paul Erdős, Zoltan Fueredi, Andras Hajnal
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
chromatic number; infinite graphs; intersecting Sperner family; local r-colorings; strong limit cardinal
05C15: Coloring of graphs and hypergraphs
Related Items
Local coloring of Kneser graphs, On colorings of graph powers, A generalization of the Erdős-Ko-Rado theorem, Local \(k\)-colorings of graphs and hypergraphs, On locally-perfect colorings, Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets, On the extremal combinatorics of the Hamming space, Colorful subgraphs in Kneser-like graphs, Local chromatic number and Sperner capacity, NP for Combinatorialists, Local chromatic number and distinguishing the strength of topological obstructions
Cites Work