The Odd Alternating Cycle Conjecture
Statement
Let be a field. For a directed graph on vertices, its minrank over , denoted by , is the minimum rank over of a matrix representing . An alternating odd cycle is a directed graph whose underlying undirected graph is an odd cycle and whose edge orientations alternate, with one exception.
Odd Alternating Cycle Conjecture. For every field there exist and an odd integer such that every -vertex directed graph with
contains an alternating cycle of length .
The conjecture was proposed in connection with circuit-complexity questions and Valiant's approach to circuit lower bounds. It was disproved over the real field, while its status over finite fields remained open in the source context.
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.