On the CNF-complexity of bipartite graphs containing no $K_{2,2}$'s
Computational Complexity
2012-06-27 v1 Discrete Mathematics
Classical Analysis and ODEs
Combinatorics
Abstract
By a probabilistic construction, we find a bipartite graph having average degree which can be expressed as a conjunctive normal form using clauses. This contradicts research problem 1.33 of Jukna.
Keywords
Cite
@article{arxiv.1206.6068,
title = {On the CNF-complexity of bipartite graphs containing no $K_{2,2}$'s},
author = {Nets Hawk Katz},
journal= {arXiv preprint arXiv:1206.6068},
year = {2012}
}
Comments
6 pages