On the Number of 2-SAT Functions

DOI10.1017/S096354830900995XzbMath1200.68125arXiv1005.2863MaRDI QIDQ3552502

L. Ilinca, Jeffry Kahn

Publication date: 22 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.2863

zbMATH Keywords

2-SAT formulae`odd-blue-triangle-free' graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Boolean functions (06E30)

Related Items (1)

The number of 3-SAT functions

Cites Work

• A note on triangle-free and bipartite graphs
• The number of 2-SAT functions
• Almost every 2-SAT function is unate
• Asymptotic Enumeration of Partial Orders on a Finite Set

This page was built for publication: On the Number of 2-SAT Functions