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

DOI10.1007/BF02122682zbMATH Open0715.05056OpenAlexW2088210486MaRDI QIDQ751675FDOQ751675

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)

Cites Work

• The longest path in a random graph
• Probability of Indecomposability of a Random Mapping Function
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• The number of connected sparsely edged uniform hypergraphs
• 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
• 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)