On the rainbow planar Tur\'an number of paths

Authors Ervin Győri, Ryan R. Martin, Addisu Paulos, Casey Tompkins, Kitti Varga

Publication date 24 January 2023

Abstract: An edge-colored graph is said to contain a rainbow-

F

if it contains

F

as a subgraph and every edge of

F

is a distinct color. The problem of maximizing edges among

n

-vertex properly edge-colored graphs not containing a rainbow-

F

, known as the rainbow Tur'an problem, was initiated by Keevash, Mubayi, Sudakov and Verstra"ete. We investigate a variation of this problem with the additional restriction that the graph is planar, and we denote the corresponding extremal number by

e x_{p}^{*} (n, F)

. In particular, we determine

e x_{p}^{*} (n, P_{5})

, where

P_{5}

denotes the

5

-vertex path.

This page was built for publication: On the rainbow planar Tur\'an number of paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6424329)