Search arXivSearch

arXiv · 1605.07082

A unified Erdős-Pósa theorem for constrained cycles

Abstract

A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups $Γ_1,Γ_2$. A cycle in a doubly group-labeled graph is $(Γ_1,Γ_2)$-non-zero if it is non-zero in both coordinates. Our main result is a generalization of the Flat Wall Theorem of Robertson and Seymour to doubly group-labeled graphs. As an application, we determine all canonical obstructions to the Erdős-Pósa property for $(Γ_1,Γ_2)$-non-zero cycles in doubly group-labeled graphs. The obstructions imply that the half-integral Erdős-Pósa property always holds for $(Γ_1,Γ_2)$-non-zero cycles. Moreover, our approach gives a unified framework for proving packing results for constrained cycles in graphs. For example, as immediate corollaries we recover the Erdős-Pósa property for cycles and $S$-cycles and the half-integral Erdős-Pósa property for odd cycles and odd $S$-cycles. Furthermore, we recover Reed's Escher-wall Theorem. We also prove many new packing results as immediate corollaries. For example, we show that the half-integral Erdős-Pósa property holds for cycles not homologous to zero, odd cycles not homologous to zero, and $S$-cycles not homologous to zero. Moreover, the (full) Erdős-Pósa property holds for $S_1$-$S_2$-cycles and cycles not homologous to zero on an orientable surface. Finally, we also describe the canonical obstructions to the Erdős-Pósa property for cycles not homologous to zero and for odd $S$-cycles.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tony Huynh, Felix Joos, Paul Wollan. 2019-03-28. A unified Erdős-Pósa theorem for constrained cycles. https://doi.org/10.1007/s00493-017-3683-z

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

KEEP EXPLORING

Related papers

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

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