The chromatic number of random graphs at the double-jump threshold

DOI10.1007/BF02122682MaRDI QIDQ751675zbMATH OpenOpenAlexFDO

Authors Tomasz Łuczak, John C. Wierman

Publication date 1989

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02122682

zbMATH Keywords

random graphsdouble-jump thresholdplanarity threshold

Mathematics Subject Classification ID

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

Recommendations

• On the chromatic number of random graphs
• On the chromatic number of random graphs
• scientific article; zbMATH DE number 3895112
• On the Chromatic Number of Random Graphs
• scientific article; zbMATH DE number 1380613

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3902655 (Why is no real title available?)
• scientific article; zbMATH DE number 3769674 (Why is no real title available?)
• Probability of Indecomposability of a Random Mapping Function
• The longest path in a random graph

Cited in

(9)

• The number of connected sparsely edged uniform hypergraphs
• Can you feel the double jump?
• Holes in random graphs
• The size of the largest hole in a random graph
• Size and connectivity of the \(k\)-core of a random graph
• A critical point for random graphs with a given degree sequence
• The jump of the clique chromatic number of random graphs
• Chromatic thresholds in dense random graphs
• Cycles in a random graph near the critical point

This page was built for publication: The chromatic number of random graphs at the double-jump threshold

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