Scaling laws for maximum coloring of random geometric graphs

DOI10.1016/j.dam.2016.10.009zbMath1358.05096arXiv1611.05070OpenAlexW2552384179MaRDI QIDQ516873

Milan Bradonjić, Sem C. Borst

Publication date: 15 March 2017

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

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

zbMATH Keywords

coloringasymptotic lawsrandom geometric graphs

Mathematics Subject Classification ID

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

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic number of random geometric graphs
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• The jackknife estimate of variance
• Unit disk graphs
• A matching problem and subadditive Euclidean functionals
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
• Random Geometric Graphs
• Limit Theorems in Discrete Stochastic Geometry
• Graph colouring and the probabilistic method

This page was built for publication: Scaling laws for maximum coloring of random geometric graphs