arXiv Analytics

Sign in

arXiv:2308.14778 [math.CO]AbstractReferencesReviewsResources

A precise condition for independent transversals in bipartite covers

Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski

Published 2023-08-28Version 1

Given a bipartite graph $H=(V=V_A\cup V_B,E)$ in which any vertex in $V_A$ (resp. $V_B$) has degree at most $D_A$ (resp. $D_B$), suppose there is a partition of $V$ that is a refinement of the bipartition $V_A\cup V_B$ such that the parts in $V_A$ (resp. $V_B$) have size at least $k_A$ (resp. $k_B$). We prove that the condition $D_A/k_A+D_B/k_B\le 1$ is sufficient for the existence of an independent set of vertices of $H$ 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 the other due to Szab\'o and Tardos.

Comments: 10 pages, 2 figures
Categories: math.CO, cs.DM
Subjects: 05C69, 05D15, 05C15, 05C35
Related articles: Most relevant | Search more
arXiv:1702.03060 [math.CO] (Published 2017-02-10)
A Variation of the Erdős-Sós Conjecture in Bipartite Graphs
arXiv:2011.01763 [math.CO] (Published 2020-11-03)
A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
arXiv:1405.1484 [math.CO] (Published 2014-05-07)
Bipartite graphs whose squares are not chromatic-choosable