Given a set $V$ of $n$ vertices and an integer $k\ge1$, our goal is to maximize the number of edges in graphs $G_1, G_2, \ldots, G_k$, defined on $V$, under the constraint that the union of all graphs, thought of as a multi-graph, does not contain a rainbow copy of the path $P_5$ on $5$ vertices, that is, a copy of $P_...
Sylwia Antoniuk, Andrzej Grzesik, Magdalena Prorok et al.· 0 citations
After the initial idea for the main proof was found by the authors, various AI models were used to streamline the argument and perform the calculations necessary for completion of the proof.
J'ozsef Balogh, Andrzej Grzesik, Bernard Lidický et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.