Related papers: Exact Algorithms for No-Rainbow Coloring and Phylo…
An edge-colored hypergraph is rainbow if all of its edges have different colors. Given two hypergraphs $\mathcal{H}$ and $\mathcal{G}$, the anti-Ramsey number $ar(\mathcal{G}, \mathcal{H})$ of $\mathcal{H}$ in $\mathcal{G}$ is the maximum…
We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time…
The graph coloring problem (GCP) is one of the most studied NP-HARD problems in computer science. Given a graph , the task is to assign a color to all vertices such that no vertices sharing an edge receive the same color and that the number…
Let $H$ be a triple system with maximum degree $d>1$ and let $r>10^7\sqrt{d}\log^{2}d$. Then $H$ has a proper vertex coloring with $r$ colors such that any two color classes differ in size by at most one. The bound on $r$ is sharp in order…
We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a graph is locally $\ell$-bounded if no vertex is incident to more…
Let $G(V,E)$ be a $k$-uniform hypergraph. A hyperedge $e \in E$ is said to be properly $(r,p)$ colored by an $r$-coloring of vertices in $V$ if $e$ contains vertices of at least $p$ distinct colors in the $r$-coloring. An $r$-coloring of…
An exact $r$-coloring of a set $S$ is a surjective function $c:S\to [r]$. The rainbow number of a set $S$ for equation $eq$ is the smallest integer $r$ such that every exact $r$-coloring of $S$ contains a rainbow solution to $eq$. In this…
An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that…
In a properly edge colored graph, a subgraph using every color at most once is called rainbow. In this thesis, we study rainbow cycles and paths in proper edge colorings of complete graphs, and we prove that in every proper edge coloring of…
We study the \textsc{Max Partial $H$-Coloring} problem: given a graph $G$, find the largest induced subgraph of $G$ that admits a homomorphism into $H$, where $H$ is a fixed pattern graph without loops. Note that when $H$ is a complete…
A rainbow matching in an edge-colored graph is a matching whose edges have distinct colors. We address the complexity issue of the following problem, \mrbm: Given an edge-colored graph $G$, how large is the largest rainbow matching in $G$?…
A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices.…
Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular…
We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where…
We present the Douglas-Rachford algorithm as a successful heuristic for solving graph coloring problems. Given a set of colors, these type of problems consist in assigning a color to each node of a graph, in such a way that every pair of…
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…
The Fano plane is the unique linear 3-uniform hypergraph on seven vertices and seven hyperedges. It was recently proved that, for all $n \geq 8$, the balanced complete bipartite 3-uniform hypergraph on $n$ vertices, denoted by $B_n$, is the…
We study the kernel complexity of constraint satisfaction problems over a finite domain, parameterized by the number of variables, whose constraint language consists of two relations: the non-equality relation and an additional…
We consider the Erd\H{o}s-R\'enyi random graph process, which is a stochastic process that starts with $n$ vertices and no edges, and at each step adds one new edge chosen uniformly at random from the set of missing edges. Let…
We extend a recent construction concerning polychromatic colorings of hereditary hypergraph families. For every integer $h\ge 4$ we construct a $(2h-1)$-uniform hypergraph which has no polychromatic $3$-coloring, but all of whose $h$-heavy…