Random I‐colorable graphs

DOI10.1002/RSA.3240060104MaRDI QIDQ4322472zbMATH OpenOpenAlexFDO

Authors Hans Jürgen Prömel, Angelika Steger

Publication date 9 February 1995

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240060104

zbMATH Keywords

chromatic numbercoloringrandom graphthreshold function

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1380613
• The concentration of the chromatic number of random graphs
• On the chromatic number of random graphs
• On the chromatic number of random regular graphs
• On the chromatic number of random graphs

Cites work

• A note on the sharp concentration of the chromatic number of random graphs
• Almost all k-colorable graphs are easy to color
• Counting Coloured Graphs of High Connectivity
• Graphs with small chromatic numbers are easy to color
• The chromatic number of random graphs
• The Number of k-Coloured Graphs on Labelled Nodes

Cited in

(11)

• Representation of graphs by OBDDs
• The typical structure of sparse \(K_{r+1}\)-free graphs
• Randomized Δ-edge colouring via exchanges of complex colours
• Random reals and polarized colorings
• scientific article; zbMATH DE number 1962838 (Why is no real title available?)
• 随机图的$f$-染色的分类 II
• An efficient container lemma
• scientific article; zbMATH DE number 5279368 (Why is no real title available?)
• On the typical structure of graphs not containing a fixed vertex-critical subgraph
• Asymptotic probabilities of extension properties and random l-colourable structures
• Why almost all k-colorable graphs are easy to color

This page was built for publication: Random I‐colorable graphs

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