A degree sequence variant of graph Ramsey numbers

DOI10.1007/S00373-013-1307-YMaRDI QIDQ742597zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

degree sequenceRamsey number

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3743297 (Why is no real title available?)
• scientific article; zbMATH DE number 3758373 (Why is no real title available?)
• scientific article; zbMATH DE number 3588696 (Why is no real title available?)
• scientific article; zbMATH DE number 1286471 (Why is no real title available?)
• scientific article; zbMATH DE number 867707 (Why is no real title available?)
• scientific article; zbMATH DE number 2188455 (Why is no real title available?)
• scientific article; zbMATH DE number 3262254 (Why is no real title available?)
• scientific article; zbMATH DE number 3390794 (Why is no real title available?)
• A General Lower Bound for Potentially H-Graphic Sequences
• A remark on the existence of finite graphs
• A variation of a conjecture due to Erdös and Sós
• Chromatic number and complete graph substructures for degree sequences
• Hadwiger number and chromatic number for near regular degree sequences
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On cycle—Complete graph ramsey numbers
• On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
• Packing of graphic \(n\)-tuples
• Small Ramsey numbers
• The Cycle-Complete Graph Ramsey Numbers
• The Ramsey numbers r(P\(_m\),K\(_n\))
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size

Cited in

(5)

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

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)