Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

DM
2016

favoriteEmaildiscussreport

45views more DM 2016»

Local and global colorability of graphs

8 years 26 days ago

Local and global colorability of graphs

Download www.math.ias.edu

It is shown that for any ﬁxed c ≥ 3 and r, the maximum possible chromatic number of a graph on n vertices in which every subgraph of radius at most r is c colorable is ˜Θ n 1 r+1 (that is, n 1 r+1 up to a factor poly-logarithmic in n). The proof is based on a careful analysis of the local and global colorability of random graphs and implies, in particular, that a random n-vertex graph with the right edge probability has typically a chromatic number as above and yet most balls of radius r in it are 2-degenerate.

Noga Alon, Omri Ben-Eliezer

Real-time Traffic

DM 2016 |

claim paper

Related Content

» Automatic Image Colorization Via Multimodal Predictions

» Multiagent Graph Coloring Pareto Efficiency Fairness and Individual Rationality

» A search space cartography for guiding graph coloring heuristics

» Color Image Segmentation Using Global Information and Local Homogeneity

» Efficient Coloring of a Large Spectrum of Graphs

» Learned color constancy from local correspondences

» Bayesian Marker Extraction for Color Watershed in Segmenting Microscopic Images

» An agentbased algorithm for generalized graph colorings

» Unsupervised Local Color Correction for Coarsely Registered Images

» Some Topological Methods in Graph Coloring Theory

Post Info
More Details (n/a)

Added	01 Apr 2016
Updated	01 Apr 2016
Type	Journal
Year	2016
Where	DM
Authors	Noga Alon, Omri Ben-Eliezer

Comments (0)