On the Number of 2-SAT Functions

Abstract

We give an alternative proof of a conjecture of Bollobás, Brightwell and Leader, first proved by Peter Allen, stating that the number of boolean functions definable by 2-SAT formulae is $(1+o(1))2^{\left(\genfrac{}{}{0ex}{}{n+1}{2}\right)}$. One step in the proof determines the asymptotics of the number of "odd-blue-triangle-free" graphs on $n$ vertices.

16 pages

References in corpus (2)

• Hypergraph regularity and the multidimensional Szemerédi theorem
• On the Number of 2-SAT Functions

Cited by in corpus (2)

• On the Number of 2-SAT Functions
• The number of 3-SAT functions