A degree sequence variant of graph Ramsey numbers

DOI10.1007/S00373-013-1307-YzbMATH Open1298.05078OpenAlexW1991047080MaRDI QIDQ742597FDOQ742597

Authors: Michael Ferrara, Stephen G. Hartke, Michael Jacobson, Arthur H. Busch 

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1307-y

Recommendations

• A new lower bound on the potential-Ramsey number of two graphs
• On the potentially \(P_k\)-graphic sequences
• On potentially \(K_{r_1,r_2,\dots,r_m}\)-graphic sequences
• An extremal problem on the potentially \(P_k\)-graphic sequences
• A note on potentially \(K_{1,1,t}\)-graphic sequences

zbMATH Keywords

degree sequenceRamsey number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• 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?)
• 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?)
• Title not available (Why is that?)
• Packing of graphic \(n\)-tuples
• Small Ramsey numbers
• Title not available (Why is that?)
• On cycle—Complete graph ramsey numbers
• The Cycle-Complete Graph Ramsey Numbers
• 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
• A variation of a conjecture due to Erdös and Sós
• Title not available (Why is that?)
• The Ramsey numbers r(P\(_m\),K\(_n\))
• Title not available (Why is that?)

Cited In (5)

• Extremal theorems for degree sequence packing and the two-color discrete tomography problem
• 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
• A further result on the potential-Ramsey number of G1 and G2
• The potential-Ramsey number of $K_n$ and $K_t^{-k}$

This page was built for publication: A degree sequence variant of graph Ramsey numbers

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