DeepAI AI Chat
Log In Sign Up

Algorithms for weighted independent transversals and strong colouring

by   Alessandra Graf, et al.

An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are known for the existence of an IT in a given graph with a given vertex partition, which have been used over the years to solve many combinatorial problems. Some of these IT existence theorems have algorithmic proofs, but there remains a gap between the best bounds given by nonconstructive results, and those obtainable by efficient algorithms. Recently, Graf and Haxell (2018) described a new (deterministic) algorithm that asymptotically closes this gap, but there are limitations on its applicability. In this paper we develop a randomized version of this algorithm that is much more widely applicable, and demonstrate its use by giving efficient algorithms for two problems concerning the strong chromatic number of graphs.


page 1

page 2

page 3

page 4


Finding Independent Transversals Efficiently

We give an efficient algorithm that, given a graph G and a partition V_1...

A fast new algorithm for weak graph regularity

We provide a deterministic algorithm that finds, in ϵ^-O(1) n^2 time, an...

On Existence of Must-Include Paths and Cycles in Undirected Graphs

Given an undirected graph G=(V,E) and vertices s,t,w_1,w_2∈ V, we study ...

Variable degeneracy on toroidal graphs

Let f be a nonnegative integer valued function on the vertex-set of a gr...

Embeddable of one-vertex graph with rotations into torus

We are interested in finding combinatorial criteria for embedding graphs...

Graphs without 2-community structures

In the context of community structure detection, we study the existence ...

A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids

The present note is a strengthening of a recent paper by K. Takazawa and...