Erdős–Faudree–Rousseau–Schelp unbalanced sparse-subset conjecture
Statement
Let be an -vertex graph and let be an arbitrary constant with . Let satisfy
If is sufficiently large and every -subset of spans at least edges, then contains a triangle. Erdős–Faudree–Rousseau–Schelp's conjecture. The stated implication holds. The conjecture is known for and was disproved for , so the source records it as a conjectural statement over the displayed range rather than as a universally settled result.
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.