Tags
Prizes
More
FAQ
Problem Lists
Definitions
Links
How to help
Go
Go
All
Random Solved
Random Open
OPEN
If $G$ has infinite chromatic number and is triangle-free (contains no $K_3$) then must $G$ contain every tree as an induced subgraph?
#738
:
[Er81]
graph theory
,
chromatic number
A conjecture of Gyárfás.
Previous
Next
