A degree sequence variant of graph Ramsey numbers

DOI10.1007/s00373-013-1307-yzbMath1298.05078OpenAlexW1991047080MaRDI QIDQ742597

Michael S. Jacobson, Stephen G. Hartke, Michael Ferrara, 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

Ramsey numberdegree sequence

Mathematics Subject Classification ID

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

Related Items

Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem, A further result on the potential-Ramsey number of G1 and G2, 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})\), A new lower bound on the potential-Ramsey number of two graphs

Cites Work

• Chromatic number and complete graph substructures for degree sequences
• On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
• A variation of a conjecture due to Erdös and Sós
• Small 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
• 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
• On cycle—Complete graph ramsey numbers
• The Cycle-Complete Graph Ramsey Numbers
• A General Lower Bound for Potentially H-Graphic Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item