Degree Ramsey Numbers of Graphs

DOI10.1017/S0963548311000617zbMath1241.05092MaRDI QIDQ2883865

William B. Kinnersley, Kevin G. Milans, Douglas B. West

Publication date: 14 May 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

\(s\)-colour degree Ramsey number of a graphedge-colourings of bounded-degree graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (6)

Degree Ramsey numbers for even cycles ⋮ On the multicolor size Ramsey number of stars and cliques ⋮ Multicolor list Ramsey numbers grow exponentially ⋮ Decomposition of bounded degree graphs into \(C_4\)-free subgraphs ⋮ Degree bipartite Ramsey numbers ⋮ Vizing's and Shannon's theorems for defective edge colouring

Cites Work

• The fractional version of Hedetniemi's conjecture is true
• A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
• Expanding graphs contain all small trees
• The Ramsey property for graphs with forbidden complete subgraphs
• The size Ramsey number
• On the Ramsey problem for multicolor bipartite graphs
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Partitioning into graphs with only small components
• Chromatic Ramsey numbers
• Bipartite subgraphs
• Regular factors of regular graphs
• The biparticity of a graph
• A note on the Size-Ramsey number of long subdivisions of graphs
• On size Ramsey number of paths, trees, and circuits. I
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Decomposition of Finite Graphs Into Forests
• On size Ramsey numbers of graphs with bounded degree

This page was built for publication: Degree Ramsey Numbers of Graphs