On the chromatic number of the preferential attachment graph

DOI10.1016/j.ejc.2021.103365zbMath1466.05073arXiv2008.00871OpenAlexW3166317815MaRDI QIDQ2033902

Lyuben Lichev

Publication date: 18 June 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

maximal independent setrandom graph model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• On the chromatic number of random regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• The diameter of a scale-free random graph
• On the independence number and the chromatic number of generalized preferential attachment models
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Paths in graphs
• Subgraphs in preferential attachment models
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The chromatic number of random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the chromatic number of the preferential attachment graph