A precise condition for independent transversals in bipartite covers

08/28/2023
by   Stijn Cambie, et al.
0

Given a bipartite graph H=(V=V_A∪ 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∪ 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≤ 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ó and Tardos.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/02/2023

The minmin coalition number in graphs

A set S of vertices in a graph G is a dominating set if every vertex of ...
research
11/11/2020

Saturating stable matchings

A bipartite graph consists of two disjoint vertex sets, where vertices o...
research
06/28/2019

Algorithms for weighted independent transversals and strong colouring

An independent transversal (IT) in a graph with a given vertex partition...
research
07/08/2022

Partition refinement for emulation

Kripke models are useful to express static knowledge or belief. On the o...
research
06/29/2020

Asymptotic enumeration of digraphs and bipartite graphs by degree sequence

We provide asymptotic formulae for the numbers of bipartite graphs with ...
research
12/25/2021

Modularity and edge sampling

Suppose that there is an unknown underlying graph G on a large vertex se...
research
07/02/2018

Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth

We present unified bijections for maps on the torus with control on the ...

Please sign up or login with your details

Forgot password? Click here to reset