8 research outputs found
On the fine-grained complexity of rainbow coloring
The Rainbow k-Coloring problem asks whether the edges of a given graph can be
colored in colors so that every pair of vertices is connected by a rainbow
path, i.e., a path with all edges of different colors. Our main result states
that for any , there is no algorithm for Rainbow k-Coloring running in
time , unless ETH fails.
Motivated by this negative result we consider two parameterized variants of
the problem. In Subset Rainbow k-Coloring problem, introduced by Chakraborty et
al. [STACS 2009, J. Comb. Opt. 2009], we are additionally given a set of
pairs of vertices and we ask if there is a coloring in which all the pairs in
are connected by rainbow paths. We show that Subset Rainbow k-Coloring is
FPT when parameterized by . We also study Maximum Rainbow k-Coloring
problem, where we are additionally given an integer and we ask if there is
a coloring in which at least anti-edges are connected by rainbow paths. We
show that the problem is FPT when parameterized by and has a kernel of size
for every (thus proving that the problem is FPT), extending the
result of Ananth et al. [FSTTCS 2011]
Extremal Problems on the Hypercube
PhDThe hypercube, Qd, is a natural and much studied combinatorial object, and we discuss
various extremal problems related to it.
A subgraph of the hypercube is said to be (Qd; F)-saturated if it contains no copies of
F, but adding any edge forms a copy of F. We write sat(Qd; F) for the saturation number,
that is, the least number of edges a (Qd; F)-saturated graph may have. We prove the
upper bound sat(Qd;Q2) < 10 2d, which strongly disproves a conjecture of Santolupo that
sat(Qd;Q2) =
�� 1 4 + o(1)
d2d��1. We also prove upper bounds on sat(Qd;Qm) for general
m.Given a down-set A and an up-set B in the hypercube, Bollobás and Leader conjectured
a lower bound on the number of edge-disjoint paths between A and B in the directed
hypercube. Using an unusual form of the compression argument, we confirm the conjecture
by reducing the problem to a the case of the undirected hypercube. We also prove an
analogous conjecture for vertex-disjoint paths using the same techniques, and extend both
results to the grid.
Additionally, we deal with subcube intersection graphs, answering a question of Johnson
and Markström of the least r = r(n) for which all graphs on n vertices may be represented as
subcube intersection graph where each subcube has dimension exactly r. We also contribute
to the related area of biclique covers and partitions, and study relationships between various
parameters linked to such covers and partitions.
Finally, we study topological properties of uniformly random simplicial complexes, employing
a characterisation due to Korshunov of almost all down-sets in the hypercube as a
key tool
Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds
We study rainbow connectivity of graphs from the algorithmic and graph-theoretic points of view. The study is divided into three parts. First, we study the complexity of deciding whether a given edge-colored graph is rainbow-connected. That is, we seek to verify whether the graph has a path on which no color repeats between each pair of its vertices. We obtain a comprehensive map of the hardness landscape of the problem. While the problem is NP-complete in general, we identify several structural properties that render the problem tractable. At the same time, we strengthen the known NP-completeness results for the problem. We pinpoint various parameters for which the problem is fixed-parameter tractable, including dichotomy results for popular width parameters, such as treewidth and pathwidth. The study extends to variants of the problem that consider vertex-colored graphs and/or rainbow shortest paths. We also consider upper and lower bounds for exact parameterized algorithms. In particular, we show that when parameterized by the number of colors k, the existence of a rainbow s-t path can be decided in O∗ (2k ) time and polynomial space. For the highly related problem of finding a path on which all the k colors appear, i.e., a colorful path, we explain the modest progress over the last twenty years. Namely, we prove that the existence of an algorithm for finding a colorful path in (2 − ε)k nO(1) time for some ε > 0 disproves the so-called Set Cover Conjecture.Second, we focus on the problem of finding a rainbow coloring. The minimum number of colors for which a graph G is rainbow-connected is known as its rainbow connection number, denoted by rc(G). Likewise, the minimum number of colors required to establish a rainbow shortest path between each pair of vertices in G is known as its strong rainbow connection number, denoted by src(G). We give new hardness results for computing rc(G) and src(G), including their vertex variants. The hardness results exclude polynomial-time algorithms for restricted graph classes and also fast exact exponential-time algorithms (under reasonable complexity assumptions). For positive results, we show that rainbow coloring is tractable for e.g., graphs of bounded treewidth. In addition, we give positive parameterized results for certain variants and relaxations of the problems in which the goal is to save k colors from a trivial upper bound, or to rainbow connect only a certain number of vertex pairs.Third, we take a more graph-theoretic view on rainbow coloring. We observe upper bounds on the rainbow connection numbers in terms of other well-known graph parameters. Furthermore, despite the interest, there have been few results on the strong rainbow connection number of a graph. We give improved bounds and determine exactly the rainbow and strong rainbow connection numbers for some subclasses of chordal graphs. Finally, we pose open problems and conjectures arising from our work