Displaying similar documents to “On some Ramsey and Turán-type numbers for paths and cycles.”

Fruit salad.

Gyárfás, András (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle

Laura Frigerio, Federico Lastaria, Norma Zagaglia Salvi (2011)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of G by a path or a cycle.

The Turàn number of the graph 3P4

Halina Bielak, Sebastian Kieliszek (2014)

Annales UMCS, Mathematica

Similarity:

Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)