Erdős problem 105
Let be disjoint sets of size and respectively, with not all of contained on a single line. Is there a line which contains at least two points from and no points from ?
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:c07d62fc2c1b6878a10db051f811d251ee08549004510ad6bb3e942cc54d67c0
- Metadata
- sha256:30ce65963af28daf53e9d0a4e37a5c8b94612c3f33060dfc5972274c0a215b7e
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:57168859334ccb71a32eed5799d56dc7bb24a7206b389f20cd8ed1883481b91f
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207