Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2010.00063

A Tight Bound for Conflict-free Coloring in terms of Distance to Cluster

Sriram Bhyravarapu·Subrahmanyam Kalyanasundaram
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given an undirected graph $G = (V,E)$, a conflict-free coloring with respect to open neighborhoods (CFON coloring) is a vertex coloring such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of colors required for such a coloring is the CFON chromatic number of $G$, denoted by $χ_{ON}(G)$. In previous work [WG 2020], we showed the upper bound $χ_{ON}(G) \leq dc(G) + 3$, where $dc(G)$ denotes the distance to cluster parameter of $G$. In this paper, we obtain the improved upper bound of $χ_{ON}(G) \leq dc(G) + 1$. We also exhibit a family of graphs for which $χ_{ON}(G) > dc(G)$, thereby demonstrating that our upper bound is tight.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram. 2020-09-30. A Tight Bound for Conflict-free Coloring in terms of Distance to Cluster. https://arxiv.org/abs/2010.00063

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗