Maximum packings in graphs forbidding given rainbow cycles
Ping Li, Yang Yang

TL;DR
This paper investigates the maximum number of edge-disjoint copies of a graph F in an n-vertex G-free graph, especially focusing on rainbow cycles, providing new bounds and characterizations for various graph pairs.
Contribution
It establishes new bounds for the F-multicolor Turán number in specific graph pairs and characterizes cases where these bounds are tight, extending previous results on rainbow cycle packings.
Findings
Proved exact asymptotics for $ex_{C_k(s)}(n,C_{k-2})$ for $k extgreater=5$.
Extended bounds for $ex_{C_{2k+1}}(n,C_{2\\ell+1})$ with $\\ell>k$.
Determined $ex_{C_4}(n,C_4)$ asymptotically.
Abstract
Motivated by the Ruzsa-Szemer\'{e}di problem, Imolay, Karl, Nagy, and V\'{a}li studied a variant of Tur\'{a}n number (called the -multicolor Tur\'{a}n number of ), defined as the maximum number of edge-disjoint copies of on -vertex set such that there is no copies of whose edges come from distinct copies of . They proved that if there is no homomorphism from to , then , and otherwise . The quantity asymptotically equals the maximum size of an -packing in an -vertex -free graph, and attains the upper bound if and only if . In this paper, we provide conditions under which does not achieve the lower bound , and describe additional graph pairs that attain this lower bound via graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Markov Chains and Monte Carlo Methods · Advanced Graph Theory Research
