On the CNF-complexity of bipartite graphs containing no $K_{2,2}$'s
Abstract
By a probabilistic construction, we find a bipartite graph having average degree $d$ which can be expressed as a conjunctive normal form using $C \log d$ clauses. This contradicts research problem 1.33 of Jukna.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2012
- DOI:
- 10.48550/arXiv.1206.6068
- arXiv:
- arXiv:1206.6068
- Bibcode:
- 2012arXiv1206.6068H
- Keywords:
-
- Computer Science - Computational Complexity;
- Computer Science - Discrete Mathematics;
- Mathematics - Classical Analysis and ODEs;
- Mathematics - Combinatorics
- E-Print:
- 6 pages