On the Number of 2-SAT Functions

Details On the Number of 2-SAT Functions On the Number of 2-SAT Functions

2010-05-12

arxiv.org/abs/1005.2863v1

Combinatorics, Probability and Computing, Volume 18, Special Issue 05 (2009), 749-764.

Mathematics

Combinatorics

16 pages

Scientific paper

10.1017/S096354830900995X

We give an alternative proof of a conjecture of Bollob\'as, 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^{\binom{n+1}{2}}$. One step
in the proof determines the asymptotics of the number of
"odd-blue-triangle-free" graphs on $n$ vertices.

Affiliated with

Also associated with

No associations

Rating

On the Number of 2-SAT Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Number of 2-SAT Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Number of 2-SAT Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-500823