The min-term graph-property sensitivity conjecture
Statement
Let be a Boolean graph property on the possible edges. A min-term graph property is a graph property of the type defined in Chakraborty's work, and is non-trivial when it is not constant. Min-term sensitivity conjecture. The sensitivity satisfies
This is proposed in the source as a weaker form of Turan's conjecture, restricted to non-trivial min-term graph properties; its status is not otherwise resolved in the supplied text.
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.