Chromatic graph with disjoints subgraphs

How to prove that a graph with chromatic number $geq 4$ has in it two disjoint by vertices subgraphs with a chromatic number of $2$ and $3$.

Also there is no $K_4$ in the original graph

I was thinking about proving by construction, but it doesn’t seem to be working.

Mathematics Asked on January 3, 2021

0 Answers

Add your own answers!

Related Questions

Morley rank of group

2  Asked on February 10, 2021 by max-cylin


Total number of combinations.

1  Asked on February 10, 2021 by hanu-goyal


Expected Value : Poker

2  Asked on February 10, 2021 by chase


Rules when calculating with limits

0  Asked on February 9, 2021


Abelian subgroup of prime power index

1  Asked on February 9, 2021 by devendra-singh-rana


Ask a Question

Get help from others!

© 2022 All rights reserved.