Local chromatic number and Sperner capacity

DOI10.1016/j.jctb.2005.03.006zbMath1071.05035OpenAlexW2061819450MaRDI QIDQ2565689

Concetta Pilotto, János Körner, Gábor Simonyi

Publication date: 28 September 2005

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.2005.03.006

zbMATH Keywords

Shannon capacityFractional chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (15)

Dynamic coloring of graphs having no \(K_5\) minor ⋮ Edge-colorings of 4-regular graphs with the minimum number of palettes ⋮ Intervals and convex sets in strong product of graphs ⋮ A Bound on the Shannon Capacity via a Linear Programming Variation ⋮ Colorings of complements of line graphs ⋮ Connectivity of strong products of graphs ⋮ Coloring chains for compression with uncertain priors ⋮ Vertex Cover in Graphs with Locally Few Colors ⋮ Local chromatic number and distinguishing the strength of topological obstructions ⋮ Partitioning transitive tournaments into isomorphic digraphs ⋮ Algorithms for finding maximum transitive subtournaments ⋮ On colorings of graph powers ⋮ A generalization of the Erdős-Ko-Rado theorem ⋮ The chromatic discrepancy of graphs ⋮ Relations between the Local Chromatic Number and Its Directed Version

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Sperner capacity of the cyclic triangle
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Coloring graphs with locally few colors
• On the Shannon capacity of a directed graph
• A Sperner-type theorem and qualitative independence
• Qualitative independence and Sperner problems for directed graphs
• Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
• The Shannon capacity of a union
• Different capacities of a digraph
• Capacities: From information theory to extremal set theory
• On the capacity of digraphs
• On the Shannon capacity of a graph
• A nontrivial lower bound on the shannon capacities of the complements of odd cycles
• Zero-error information theory
• Hide and Seek, Data Storage, and Entropy
• Colour number, capacity, and perfectness of directed graphs

This page was built for publication: Local chromatic number and Sperner capacity