Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] On star-critical and upper size Ramsey numbers
In this paper, we study the upper size Ramsey number u (G 1, G 2), defined by Erdős and
Faudree, as well as the star-critical Ramsey number r∗(G 1, G 2), defined by Hook and …
Faudree, as well as the star-critical Ramsey number r∗(G 1, G 2), defined by Hook and …
Minimal Ramsey graphs on deleting stars for generalized fans and books
Y Li, Y Li, Y Wang - Applied Mathematics and Computation, 2020 - Elsevier
Abstract Let F, G 1 and G 2 be simple graphs. Denote by F→(G 1, G 2) each edge coloring of
F by red and blue that contains a red G 1 or a blue G 2. Define the star-critical Ramsey …
F by red and blue that contains a red G 1 or a blue G 2. Define the star-critical Ramsey …
[HTML][HTML] Deleting edges from Ramsey graphs
Y Wang, Y Li - Discrete Mathematics, 2020 - Elsevier
For graphs F, G and H, let F→(G, H) signify that any red–blue edge coloring of F contains
either a red G or a blue H. Define the Ramsey number R (G, H) to be the smallest r such that …
either a red G or a blue H. Define the Ramsey number R (G, H) to be the smallest r such that …
[كتاب][B] Star-critical Ramsey numbers for graphs
MR Budden - 2023 - Springer
Star-critical Ramsey numbers were originally introduced by Jonelle Hook in her dissertation
[47] in 2010, working under the direction of her advisor, Garth Isaak. In their short existence …
[47] in 2010, working under the direction of her advisor, Garth Isaak. In their short existence …
Star-critical Ramsey numbers involving graphs with long suspended paths
Y Wang, Y Li, Y Li - Discrete Mathematics, 2021 - Elsevier
For graphs F, G and H, let F→(G, H) signify that any red/blue edge coloring of F contains a
red G or a blue H. The star-critical Ramsey number RS (G, H)= max {n| K r∖ K 1, n→(G, H)} …
red G or a blue H. The star-critical Ramsey number RS (G, H)= max {n| K r∖ K 1, n→(G, H)} …
Star-critical Ramsey numbers of wheels versus odd cycles
Y Liu, Y Chen - Acta Mathematicae Applicatae Sinica, English Series, 2022 - Springer
Let K 1, k be a star of order k+ 1 and K n⨆ K 1, k the graph obtained from a complete graph K
n and an additional vertex v by joining v to k vertices of K n. For graphs G and H, the star …
n and an additional vertex v by joining v to k vertices of K n. For graphs G and H, the star …
[HTML][HTML] Polarity graphs and Ramsey numbers for C4 versus stars
X Zhang, Y Chen, TCE Cheng - Discrete Mathematics, 2017 - Elsevier
For two given graphs G 1 and G 2, the Ramsey number R (G 1, G 2) is the smallest integer N
such that for any graph of order N, either G contains a copy of G 1 or its complement …
such that for any graph of order N, either G contains a copy of G 1 or its complement …
Star-critical Ramsey numbers of cycles versus wheels
Y Liu, Y Chen - Graphs and Combinatorics, 2021 - Springer
For two graphs G 1 and G 2, the star-critical Ramsey number r∗(G 1, G 2) is the minimum
integer k such that any red/blue edge-coloring of K r-1⊔ K 1, k contains a red copy of G 1 or …
integer k such that any red/blue edge-coloring of K r-1⊔ K 1, k contains a red copy of G 1 or …
[HTML][HTML] Maximum star deleted from Ramsey graphs of book and tree
Y Wang, Y Li, Y Li - Theoretical Computer Science, 2020 - Elsevier
For graphs F, G and H, let F→(G, H) signify that any red/blue edge coloring of F contains a
red G or a blue H. Define the Ramsey number R (G, H) to be the smallest r such that K r→(G …
red G or a blue H. Define the Ramsey number R (G, H) to be the smallest r such that K r→(G …
Star-critical Ramsey numbers involving large books
X Chen, Q Lin, L Niu - Discrete Mathematics, 2025 - Elsevier
For graphs F, G and H, let F→(G, H) signify that any red/blue edge coloring of F contains
either a red G or a blue H. The Ramsey number r (G, H) is defined to be the smallest integer …
either a red G or a blue H. The Ramsey number r (G, H) is defined to be the smallest integer …