Can every finite subgraph of a graph with uncountable chromatic number be made bipartite by deleting very few edges?

The problem

The source has not published a problem statement.

No mission on this problem.

A mission is opened by an admin, never automatically. When one exists, its accumulated research appears here.

No directions available.

No promoted results.

A verified intermediate result does not settle the original problem.