Publication Date

7-6-2026

Document Type

Article

Organizational Units

College of Natural Science and Mathematics, Mathematics

Keywords

Odd covers, Graphs, Minimum cardinality, Bipartite graphs, Disjoint unions

Abstract

Babai and Frankl posed the โ€œodd cover problemโ€ of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order ๐‘› is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always โŒˆ๐‘›/2โŒ‰ or โŒˆ๐‘›/2โŒ‰+1 and that it is the former whenever ๐‘› is a multiple of 8. In this paper, we determine this value to be โŒˆ๐‘›/2โŒ‰ whenever ๐‘› is odd or equivalent to 18 modulo 24. We also further the study of odd covers of graphs which are not complete, wherein edges are covered an odd number of times and nonedges an even number of times by the complete bipartite graphs in the collection. Among various results on disjoint unions, we find the minimum cardinality of an odd cover of a union of odd cliques and of a union of cycles.

Copyright Date

7-6-2026

Copyright Statement / License for Reuse

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Rights Holder

The Authors

Provenance

Received from author

File Format

application/pdf

Language

English (eng)

Extent

15 pgs

File Size

2420 KB

Publication Statement

Copyright is held by the authors. Journal of Graph Theory published by Wiley Periodicals LLC. User is responsible for all copyright compliance. Article originally published as:ย 

Buchanan, C., Clifton, A., Culver, E., Frankl, P., Nie, J., Ozeki, K., Rombach, P., and Yin, M. (2026). On odd covers of cliques and disjoint unions. Journal of Graph Theory, online first. https://doi.org/10.1002/jgt.70091

Publication Title

Journal of Graph Theory

ISSN

1097-0118



Included in

Mathematics Commons

Share

COinS