Erdős Problem #128 — Dense Large Induced Subgraphs Force a Triangle
Statement
Let be a finite simple graph with vertices. Suppose that every vertex subset satisfying
has an induced subgraph with more than edges. Must contain a triangle?
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.