Erdős Problem #833 — Large vertex degree in a three-chromatic set system
Is there a constant such that every three-chromatic set system whose members all have size at least has an element belonging to at least members?
References
Additional references
P. Erdős, Some unsolved problems in graph theory and combinatorial analysis, Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), Academic Press (1971), 97–109.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.