SCHWEITZER 1976 Problem 2
Let be an infinite graph such that for any countably infinite vertex set there is a vertex , not in , joined to infinitely many elements of . Show that has a countably infinite vertex set such that contains uncountably infinitely many vertices joined to infinitely many elements of .
P. Erdos, A. Hajnal
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.