Area: Graph theory, infinite graphs
Title: Embedding 4-chromatic graphs into two uncountably chromatic graphs
Problem Description: Is it true that if , are uncountably chromatic graphs, then there is a 4-chromatic graph H embeddable into both ?
Background: This is well-known with "3-chromatic" in place of "4-chromatic" as it is known that every uncountably chromatic graph contains every long enough odd circuit.
Contact person: Péter Komjáth (email@example.com)
Posted by: Vince Grolmusz (firstname.lastname@example.org)
Originated from: Paul Erdõs