A further result on the potential-Ramsey number of G1 and G2

DOI10.2298/FIL1906605DzbMATH Open1499.05605MaRDI QIDQ5080786FDOQ5080786

Authors: Jin-zhi Du, Jian-Hua Yin 

Publication date: 31 May 2022

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

graphic sequencepotential-Ramsey number

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Title not available (Why is that?)
• A General Lower Bound for Potentially H-Graphic Sequences
• A remark on the existence of finite graphs
• Title not available (Why is that?)
• Packing of graphic \(n\)-tuples
• On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
• Hadwiger number and chromatic number for near regular degree sequences
• Chromatic number and complete graph substructures for degree sequences
• Graphic sequences and split graphs
• A variation of a conjecture due to Erdös and Sós
• Title not available (Why is that?)
• A degree sequence variant of graph Ramsey numbers

Cited In (3)

• The potential-Ramsey numbers \(r_{pot} (C_n,K_t^{-k})\) and \(r_{pot}(P_n,K_t^{-k})\)
• A new lower bound on the potential-Ramsey number of two graphs
• The potential-Ramsey number of $K_n$ and $K_t^{-k}$

This page was built for publication: A further result on the potential-Ramsey number of G1 and G2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080786)