A remark on the Čebyšev property

Bohdan Zelinka

Displaying similar documents to “A remark on the Čebyšev property”

Hereditary properties of tournaments.

Balogh, József, Bollobás, Béla, Morris, Robert (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On path-quasar Ramsey numbers

Binlong Li, Bo Ning (2015)

Annales UMCS, Mathematica

Similarity:

Let G1 and G2 be two given graphs. The Ramsey number R(G1,G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or Ḡ contains a G2. Parsons gave a recursive formula to determine the values of R(Pn,K1,m), where Pn is a path on n vertices and K1,m is a star on m+1 vertices. In this note, we study the Ramsey numbers R(Pn,K1,m), where Pn is a linear forest on m vertices. We determine the exact values of R(Pn,K1∨Fm) for the cases m ≤ n and m ≥ 2n, and...

The Crossing Numbers of Products of Path with Graphs of Order Six

Marián Klešč, Jana Petrillová (2013)

Discussiones Mathematicae Graph Theory

Similarity:

The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known. In this paper, the crossing numbers of Cartesian products G⃞Pn for graphs G of order six are studied. Let H denote the unique tree of order six with two vertices of degree three. The main contribution is that the crossing number of the...