Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1712.00163

On Edge-Colored Saturation Problems

Michael Ferrara·Daniel Johnston·Sarah Loeb·Florian Pfender·Alex Schulte·Heather C. Smith·Eric Sullivan·Michael Tait·Casey Tompkins
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $\mathcal{C}$ be a family of edge-colored graphs. A $t$-edge colored graph $G$ is $(\mathcal{C}, t)$-saturated if $G$ does not contain any graph in $\mathcal{C}$ but the addition of any edge in any color in $[t]$ creates a copy of some graph in $\mathcal{C}$. Similarly to classical saturation functions, define $\mathrm{sat}_t(n, \mathcal{C})$ to be the minimum number of edges in a $(\mathcal{C},t)$ saturated graph. Let $\mathcal{C}_r(H)$ be the family consisting of every edge-colored copy of $H$ which uses exactly $r$ colors. In this paper we consider a variety of colored saturation problems. We determine the order of magnitude for $\mathrm{sat}_t(n, \mathcal{C}_r(K_k))$ for all $r$, showing a sharp change in behavior when $r\geq \binom{k-1}{2}+2$. A particular case of this theorem proves a conjecture of Barrus, Ferrara, Vandenbussche, and Wenger. We determine $\mathrm{sat}_t(n, \mathcal{C}_2(K_3))$ exactly and determine the extremal graphs. Additionally, we document some interesting irregularities in the colored saturation function.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Ferrara, Daniel Johnston, Sarah Loeb, Florian Pfender, Alex Schulte, Heather C. Smith, Eric Sullivan, Michael Tait, Casey Tompkins. 2017-12-01. On Edge-Colored Saturation Problems. https://arxiv.org/abs/1712.00163

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↗