A new lower bound on the potential-Ramsey number of two graphs

DOI10.1007/s10255-021-0999-7zbMath1464.05043OpenAlexW3118257233MaRDI QIDQ2025212

Jin-zhi Du, Jian Hua Yin

Publication date: 11 May 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-021-0999-7

zbMATH Keywords

graphic sequencepotential-Ramsey number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Vertex degrees (05C07)

Related Items (2)

The potential-Ramsey number of $K_n$ and $K_t^{-k}$ ⋮ The potential-Ramsey numbers \(r_{pot} (C_n,K_t^{-k})\) and \(r_{pot}(P_n,K_t^{-k})\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic number and complete graph substructures for degree sequences
• Graphic sequences and split graphs
• On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
• A degree sequence variant of graph Ramsey numbers
• A variation of a conjecture due to Erdös and Sós
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• Packing of graphic n-tuples
• Hadwiger number and chromatic number for near regular degree sequences
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A further result on the potential-Ramsey number of G1 and G2
• A General Lower Bound for Potentially H-Graphic Sequences

This page was built for publication: A new lower bound on the potential-Ramsey number of two graphs