Odd Covers of Graphs
Calum Buchanan, Alexander Clifton, Eric Culver, Jiaxi Nie, Jason, O'Neill, Puck Rombach, Mei Yin

TL;DR
This paper investigates the minimum number of complete bipartite subgraphs needed to cover the edges of a graph with parity conditions, establishing bounds and exact values for specific graph classes and subsets of integers.
Contribution
It introduces a new lower bound for the odd cover number based on the adjacency matrix rank and determines this number for certain classes of graphs and subsets of integers.
Findings
Lower bound for $b_2(G)$ based on adjacency matrix rank over $ extbf{F}_2$
Exact values of $b_2(G)$ for bipartite graphs and odd cycles
Determination of $b_2(K_n)$ for a density $3/8$ subset of positive integers
Abstract
Given a finite simple graph , an odd cover of is a collection of complete bipartite graphs, or bicliques, in which each edge of appears in an odd number of bicliques and each non-edge of appears in an even number of bicliques. We denote the minimum cardinality of an odd cover of by and prove that is bounded below by half of the rank over of the adjacency matrix of . We show that this lower bound is tight in the case when is a bipartite graph and almost tight when is an odd cycle. However, we also present an infinite family of graphs which shows that this lower bound can be arbitrarily far away from . Babai and Frankl (1992) proposed the "odd cover problem," which in our language is equivalent to determining . Radhakrishnan, Sen, and Vishwanathan (2000) determined for an infinite but density…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
