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

DOI10.37236/13346MaRDI QIDQ6671604zbMATH OpenFDO

Authors Annika Heckel

Publication date 27 January 2025

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

Full work available at URL https://doi.org/10.37236/13346

zbMATH Keywords

cochromatic numbercomplete graph

Mathematics Subject Classification ID

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

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

Cites work

• How does the chromatic number of a random graph vary?
• scientific article; zbMATH DE number 434912 (Why is no real title available?)
• Non-concentration of the chromatic number of a random graph
• Percolation
• Some of my favorite coloring problems for graphs and digraphs

Cited in

(1)

• On the difference between the chromatic and cochromatic number

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)