Skip to content

Author

Ping Zhang

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Aug 2026

Strong Ramsey Numbers of All Sets of Three Graphs of Size 3

The strong Ramsey number R¯(F,H) of two graphs F and H without isolated vertices is the minimum positive integer n such that every red-blue (edge) coloring of Kn results in two edge-disjoint monochromatic subgraphs, one isomorphic to F and the other isomorphic to H. These numbers have been determined for all such pairs...

G. Chartrand, Ping Zhang · 0 citations
Open access Jul 2026

Target Ramsey numbers in graphs

<p>The Ramsey number <span class="math inline">\(R(G)\)</span> of a graph <span class="math inline">\(G\)</span> without isolated vertices is the minimum positive integer <span class="math inline">\(n\)</span> such that for every red-blue coloring of the complete graph <span class="math inline">\(K_n\)</span> of order...

G. Chartrand, Ping Zhang · 1 citation · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.