conjecture for k “ 2 was proved by Allen [1] and k “ 3 by Ilinca and Kahn [6].
Statement
conjecture for k “ 2 was proved by Allen [1] and k “ 3 by Ilinca and Kahn [6]. Bollobás and Brightwell [2] conjectured that if k “ kpnq is allowed to increase with n, as long as k ď p1{2 ´ cqn for some constant c ą 0, the number of k-SAT n functions on n-variables is 2p1op1qqpk q . The situation is different for k ě n\{2. In our work, we reduce Conjecture 1, for each fixed k, to a Turán problem on partially directed k-uniform hypergraphs. We also prove the k “ 4 case of the conjecture via extremal graph theoretic arguments. A brute-force computation by Nitya Mani and Edward Yu also verifies the k “ 5 case of the conjecture.} Bollobás, Brightwell, and Leader proved a weaker version of this conjecture for k “ 2: the number of 2-SAT functions on n boolean variables is 2p1op1qqp 2 q . The n A partially directed k-graph (k-PDG for short) is obtained by starting with a k- uniform hypergraph and “orienting” some of the edges. To orient an edge means to pick a vertex in the edge. Below we write}
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.