On a question of Erdős and Gimbel on the cochromatic number

DOI10.37236/13346MaRDI QIDQ6671604FDOQ6671604

Authors: Annika Heckel 

Publication date: 27 January 2025

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Non-concentration of the chromatic number of a random graph
• Subgraphs with a large cochromatic number
• scientific article; zbMATH DE number 434912
• On the chromatic number of random graphs
• On the Chromatic Number of Random Graphs

zbMATH Keywords

complete graphcochromatic number

Mathematics Subject Classification ID

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

Cites Work

• Percolation
• Title not available (Why is that?)
• Non-concentration of the chromatic number of a random graph
• Some of my favorite coloring problems for graphs and digraphs
• How does the chromatic number of a random graph vary?

This page was built for publication: On a question of Erdős and Gimbel on the cochromatic number

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