14,210 research outputs found
Conflict-free coloring of graphs
We study the conflict-free chromatic number chi_{CF} of graphs from extremal
and probabilistic point of view. We resolve a question of Pach and Tardos about
the maximum conflict-free chromatic number an n-vertex graph can have. Our
construction is randomized. In relation to this we study the evolution of the
conflict-free chromatic number of the Erd\H{o}s-R\'enyi random graph G(n,p) and
give the asymptotics for p=omega(1/n). We also show that for p \geq 1/2 the
conflict-free chromatic number differs from the domination number by at most 3.Comment: 12 page
Sharp Concentration of Hitting Size for Random Set Systems
Consider the random set system of {1,2,...,n}, where each subset in the power
set is chosen independently with probability p. A set H is said to be a hitting
set if it intersects each chosen set. The second moment method is used to
exhibit the sharp concentration of the minimal size of H for a variety of
values of p.Comment: 11 page
The bondage number of random graphs
A dominating set of a graph is a subset of its vertices such that every
vertex not in is adjacent to at least one member of . The domination
number of a graph is the number of vertices in a smallest dominating set of
. The bondage number of a nonempty graph is the size of a smallest set
of edges whose removal from results in a graph with domination number
greater than the domination number of . In this note, we study the bondage
number of binomial random graph . We obtain a lower bound that matches
the order of the trivial upper bound. As a side product, we give a one-point
concentration result for the domination number of under certain
restrictions
Tropical Dominating Sets in Vertex-Coloured Graphs
Given a vertex-coloured graph, a dominating set is said to be tropical if
every colour of the graph appears at least once in the set. Here, we study
minimum tropical dominating sets from structural and algorithmic points of
view. First, we prove that the tropical dominating set problem is NP-complete
even when restricted to a simple path. Then, we establish upper bounds related
to various parameters of the graph such as minimum degree and number of edges.
We also give upper bounds for random graphs. Last, we give approximability and
inapproximability results for general and restricted classes of graphs, and
establish a FPT algorithm for interval graphs.Comment: 19 pages, 4 figure
A domination algorithm for -instances of the travelling salesman problem
We present an approximation algorithm for -instances of the
travelling salesman problem which performs well with respect to combinatorial
dominance. More precisely, we give a polynomial-time algorithm which has
domination ratio . In other words, given a
-edge-weighting of the complete graph on vertices, our
algorithm outputs a Hamilton cycle of with the following property:
the proportion of Hamilton cycles of whose weight is smaller than that of
is at most . Our analysis is based on a martingale approach.
Previously, the best result in this direction was a polynomial-time algorithm
with domination ratio for arbitrary edge-weights. We also prove a
hardness result showing that, if the Exponential Time Hypothesis holds, there
exists a constant such that cannot be replaced by in the result above.Comment: 29 pages (final version to appear in Random Structures and
Algorithms
- …