Erdős Problem #883 — For A⊆ 1,…,n let G(A) be the graph with vertex set A, where two integers are joined by an edge if they are coprime.
Statement
For let be the graph with vertex set , where two integers are joined by an edge if they are coprime. Is it true that if then contains all odd cycles of length ? Is it true that, for every , if is sufficiently large and then must contain a complete triparite graph on vertices?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.