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

DOI10.1007/BF02122682zbMath0715.05056OpenAlexW2088210486MaRDI QIDQ751675

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)

Related Items

Cycles in a random graph near the critical point, The number of connected sparsely edged uniform hypergraphs, Holes in random graphs, Size and connectivity of the \(k\)-core of a random graph, The size of the largest hole in a random graph, A critical point for random graphs with a given degree sequence

Cites Work

• The longest path in a random graph
• Probability of Indecomposability of a Random Mapping Function
• Unnamed Item
• Unnamed Item
• Unnamed Item