A Precise Condition for Independent Transversals in Bipartite Covers
- 6 May 2024
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 38 (2) , 1451-1461
Abstract
Given a bipartite graph [Formula: see text] in which any vertex in [Formula: see text] (resp., [Formula: see text]) has degree at most [Formula: see text] (resp., [Formula: see text]), suppose there is a partition of [Formula: see text] that is a refinement of the bipartition [Formula: see text] such that the parts in [Formula: see text] (resp., [Formula: see text]) have size at least [Formula: see text] (resp., [Formula: see text]). We prove that the condition [Formula: see text] is sufficient for the existence of an independent set of vertices of [Formula: see text] 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ó and Tardos.Keywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada
- Institute for Basic Science (IBS-R029-C4)
- KU Leuven (PDMT1/22/005)
- KU Leuven
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (639.032.614, 024.002.003)
This publication has 13 references indexed in Scilit:
- Asymmetric List Sizes in Bipartite GraphsAnnals of Combinatorics, 2021
- Bounded transversals in multipartite graphsJournal of Graph Theory, 2011
- Independent systems of representatives in weighted graphsCombinatorica, 2007
- Extremal Problems For Transversals In Graphs With Bounded DegreeCombinatorica, 2006
- A note on group coloringsJournal of Graph Theory, 2005
- A Note on Vertex List ColouringCombinatorics, Probability and Computing, 2001
- The list colouring constantsJournal of Graph Theory, 1999
- The choice number of random bipartite graphsAnnals of Combinatorics, 1998
- A condition for matchability in hypergraphsGraphs and Combinatorics, 1995
- On complete subgraphs of r-chromatic graphsDiscrete Mathematics, 1975