Discrepancies of spanning trees in dense graphs

TL;DR

This paper investigates combinatorial discrepancy of spanning trees in dense graphs, establishing new bounds and structural conditions for embeddings in multi-coloured complete graphs and dense host graphs.

Contribution

It generalizes discrepancy results from two to many colours and characterizes when near-perfect edge distributions are impossible in dense graphs.

Findings

Existence of spanning trees with significantly more edges in a particular colour.

Conditions under which colour imbalance in embeddings is unavoidable.

Characterization of graph and colouring pairs with minimal edge difference.

Abstract

We address several related problems on combinatorial discrepancy of trees in a setting introduced by Erd\H{o}s, F\"{u}redi, Loebl and S\'{o}s. Given a fixed tree $T$ on $n$ vertices and an edge-colouring of the complete graph $K_n$, for every colour, we find a copy of $T$ in $K_n$ where the number of edges in that colour significantly exceeds its expected count in a uniformly random embedding. This resolves a problem posed by Erd\H{o}s, F\"{u}redi, Loebl and S\'{o}s by generalising their work from two to many colours. Furthermore, if $T$ has maximum degree $\Delta\leq\epsilon n$ for sufficiently small $\epsilon > 0$ and the edge-colouring of $K_n$ is both balanced and ``not too close'' to one particular instance, we show that, for every colour, there is a copy of $T$ in $K_n$ where that colour appears on linearly more edges than any other colour. Several related examples are provided to demonstrate the necessity of the introduced structural restrictions. Our proofs combine saturation arguments for the existence of particular coloured substructures and analysis of conveniently defined local exchanges. Using similar methods, we investigate the existence of copies of a graph $H$ with prescribed number of edges in each colour in $2$-edge-coloured dense host graphs. In particular, for a graph $H$ with bounded maximum degree and balanced $2$-edge-colourings $\mathbf{c}$ of a host graph $G$ with minimum degree at least $(1-\epsilon)n$ for some $\epsilon > 0$, we show that, for any sufficiently large $n$ and sufficiently small $\epsilon$, there exists a copy of $H$ where the number of edges in the two colours differ by at most $2$. Moreover, we completely characterise the pairs $(H,\mathbf{c})$ for which the difference of $2$ cannot be improved, refuting a conjecture by Mohr, Pardey, and Rautenbach.