The classification of f-coloring of random graphs

DOI10.6040/J.ISSN.1671-9352.0.2018.333zbMATH Open1449.05113MaRDI QIDQ5209828FDOQ5209828

Authors: Yaping Xiong, Jiansheng Cai 

Publication date: 22 January 2020

Recommendations

• 随机图的$f$-染色的分类 II
• Edge-colouring random graphs
• The classification of \(f\)-coloring of graphs with large maximum degree
• \(f\)-colorings of some graphs of \(f\)-class 1
• Graphs of \(f\)-class 1

zbMATH Keywords

random graphslocal lemma\(f\)-coloring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)
• Edge-colouring random graphs
• Correlation decay and deterministic FPTAS for counting colorings of a graph
• A note on non-isomorphic edge-color classes in random graphs
• 随机图的$f$-染色的分类 II

This page was built for publication: The classification of \(f\)-coloring of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5209828)