Erdős four-edge intersection problem
Statement
For an -vertex graph and a permutation of its vertex set, define , and let be the minimum possible value of over all -vertex graphs satisfying for every permutation . The problem asks whether, for all sufficiently large integers , .
Record
- Added
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.