Multicolor Tur\'an numbers
Andr\'as Imolay, J\'anos Karl, Zolt\'an L\'or\'ant Nagy, Benedek, V\'ali

TL;DR
This paper investigates a generalized Turán problem involving edge-disjoint copies of a fixed graph and forbidden subgraphs, providing asymptotic results and characterizing certain pairs of graphs where the maximum number is quadratic.
Contribution
It characterizes pairs of graphs for which the maximum number of edge-disjoint copies is quadratic and develops asymptotic bounds using advanced combinatorial tools.
Findings
Identifies pairs {F, G} with quadratic order of magnitude for ex_F(n,G)
Provides asymptotic bounds for edge-disjoint graph packings
Utilizes regularity lemma, supersaturation, and graph packing techniques
Abstract
We consider a natural generalisation of Tur\'an's forbidden subgraph problem and the Ruzsa-Szemer\'edi problem by studying the maximum number of edge-disjoint copies of a fixed graph can be placed on an -vertex ground set without forming a subgraph whose edges are from different -copies. We determine the pairs for which the order of magnitude of is quadratic and prove several asymptotic results using various tools from the regularity lemma and supersaturation to graph packing results.
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.
