Local and global colorability of graphs

DOI10.1016/J.DISC.2015.09.006zbMath1327.05097arXiv1410.6236OpenAlexW1824385373MaRDI QIDQ898084

Omri Ben-Eliezer, Noga Alon

Publication date: 8 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

local chromatic number2-degeneracylocal colorability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On coloring graphs with locally small chromatic number
• A note on Ramsey numbers
• Graph Theory and Probability
• On circuits and subgraphs of chromatic graphs
• Cliques in random graphs
• Independence numbers of locally sparse graphs and a Ramsey type problem
• Bounding Ramsey numbers through large deviation inequalities
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: Local and global colorability of graphs