Erdős Problem #1034 — Vertices Joined to Two Vertices of a Triangle
Statement
For a graph and finite vertex sets , say that is joined to two vertices of if every is adjacent to two distinct vertices . Is it true that, for every , all sufficiently large , and every graph on vertices with more than edges, there exist a triangle in and a set of vertices such that every vertex of is adjacent to at least two vertices of and
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.