Subgraphs with a large cochromatic number

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199708)25:4<295::AID-JGT7>3.0.CO;2-F" /><295::AID-JGT7>3.0.CO;2-F 10.1002/(SICI)1097-0118(199708)25:4<295::AID-JGT7>3.0.CO;2-FzbMath0882.05061OpenAlexW2108952454MaRDI QIDQ4351317

Michael Krivelevich, Noga Alon, Benjamin Sudakov

Publication date: 2 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199708)25:4<295::aid-jgt7>3.0.co;2-f

zbMATH Keywords

partitionindependent setcochromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (5)

On the chromatic number in the stochastic block model ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ Approximating minimum cocolorings. ⋮ Fractional cocoloring of graphs

This page was built for publication: Subgraphs with a large cochromatic number