Publikace na Matematicko-fyzikální fakulta |
2023
Abstrakt
For two graphs G= 6, and we determine the numbers r= 3. We also prove r<(NMm<, Kn< ) =O(mn) for arbitrary m and n.
We expand the classical notion of Ramsey goodness to the ordered case and we attempt to characterize all connected ordered graphs that are n-good for every n is an element of N. In particular, we discover a new class of ordered trees that are n-good for every n is an element of N, extending all the previously known examples.(c) 2022 Elsevier B.V.
All rights reserved.