ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ff be a Boolean graph property on the (n2){n \choose 2} possible edges. A min-term graph property is a graph property of the type defined in Chakraborty's work, and ff is non-trivial when it is not constant. Min-term sensitivity conjecture. The sensitivity satisfies

s(f)≥n−1.s(f)\geq n-1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.