Loading problem…
Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let be a graph on at most vertices which contains no and no (the complete bipartite graph with vertices in each class). Is it true that
What about finite ?
Source: erdosproblems.com/597
No claim settles this problem.
Open. The site's proof-claims tab lists one proof claim, filed there as a full claim; its text answers only the first question, granted Baumgartner's unproved relation, and it is recorded as a conditional claim on its claim page. The site shows no verdict and labels the problem OPEN.