On the CNF-complexity of bipartite graphs containing no K2,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 d clauses. This contradicts research problem 1.33 of Jukna.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.