A precise condition for independent transversals in bipartite covers
Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski

TL;DR
This paper establishes a sharp, precise condition involving degrees and partition sizes that guarantees the existence of an independent transversal in bipartite graphs, extending classical results in the field.
Contribution
The paper introduces a new sharp condition for independent transversals in bipartite graphs, refining previous results and providing a more precise criterion.
Findings
Proves that D_A/k_B + D_B/k_A ≤ 1 guarantees an independent transversal.
Shows the condition is sharp and cannot be improved.
Extends classical results on independent transversals to bipartite graphs.
Abstract
Given a bipartite graph in which any vertex in (resp.~) has degree at most (resp.~), suppose there is a partition of that is a refinement of the bipartition such that the parts in (resp.~) have size at least (resp.~). We prove that the condition is sufficient for the existence of an independent set of vertices of that is simultaneously transversal to the partition, and show moreover that this condition is sharp. This result is a bipartite refinement of two well-known results on independent transversals, one due to the second author and the other due to Szab\'o and Tardos.
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.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Mathematics and Applications
