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
For every integer $r\ge4$, and $\rho \in [0,1]$, we asymptotically determine the maximum proportion of $r$-element sets of vertices that induce either a clique or an independent set in a large graph with density $\rho$. This generalizes a result of Olpp for $r=3$. After the initial idea for the main proof was found by...
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.