Ramsey numbers for sparse graphs

DOI10.1016/S0012-365X(97)00184-2zbMath0955.05071MaRDI QIDQ1584253

Nancy Eaton

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ramsey numbersparse graphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items

Short proofs of some extremal results. II., On two problems in graph Ramsey theory, Bounds for graph regularity and removal lemmas, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Hypergraph Packing and Sparse Bipartite Ramsey Numbers, Monochromatic bounded degree subgraph partitions, On graphs with linear Ramsey numbers, Directed Ramsey number for trees, Ramsey numbers of sparse hypergraphs, Monochromatic trees in random tournaments, Fraternal augmentations, arrangeability and linear Ramsey numbers

Cites Work

• The Ramsey number of a graph with bounded maximum degree
• Graphs with linearly bounded Ramsey numbers
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item