Degree Ramsey numbers of graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1241.05092
DOI: 10.1017/S0963548311000617
author: William B. Kinnersley
author: Kevin G. Milans
author: Douglas B. West
published in: Combinatorics, Probability and Computing
publication date: 2012-05-14T00:00:00Z
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6034360
zbMATH Keywords: \(s\)-colour degree Ramsey number of a graph
zbMATH Keywords: edge-colourings of bounded-degree graphs
MaRDI profile type: Publication
cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
cites work: Decomposition of Finite Graphs Into Forests
cites work: Expanding graphs contain all small trees
cites work: On the Ramsey problem for multicolor bipartite graphs
cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
cites work: The size Ramsey number
cites work: Regular factors of regular graphs
cites work: A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
cites work: A note on the Size-Ramsey number of long subdivisions of graphs
cites work: On size Ramsey number of paths, trees, and circuits. I
cites work: Partitioning into graphs with only small components
cites work: Bipartite subgraphs
cites work: The fractional version of Hedetniemi's conjecture is true
cites work: Chromatic Ramsey numbers
cites work: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
cites work: On size Ramsey numbers of graphs with bounded degree
cites work: The Ramsey property for graphs with forbidden complete subgraphs
cites work: The biparticity of a graph
title: Degree Ramsey numbers of graphs
description: scientific article; zbMATH DE number 6034360