The far-from-Turán positive discrepancy conjecture
Statement
For a graph on vertices, call -far from if at least edge changes are required to obtain a graph isomorphic to . A Turán graph is a complete multipartite graph whose parts are as equal in size as possible.
Far-from-Turán discrepancy conjecture. For every , there exists such that, if is an -vertex graph that is -far from every Turán graph, including the empty graph, then
The conjecture proposes that graphs far from all Turán graphs have substantially larger positive discrepancy than the known examples. The source gives a de Caen construction showing the scale is motivated, but the assertion remains open.
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.