Generalized Ramsey theory for graphs. I: Diagonal numbers

DOI10.1007/BF02018466zbMath0256.05107OpenAlexW2089413508MaRDI QIDQ2558865

Frank Harary, Václav Chvátal

Publication date: 1973

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02018466

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Unnamed Item ⋮ Multicolored set multipartite Ramsey numbers ⋮ Computation of new diagonal graph Ramsey numbers ⋮ Ramsey numbers of trees versus fans ⋮ Ramsey numbers of trees and unicyclic graphs versus fans ⋮ Path-cycle Ramsey numbers ⋮ On multicolor Ramsey numbers for complete bipartite graphs ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ Path-path Ramsey type numbers for the complete bipartite graph ⋮ Ramsey numbers of trees versus odd cycles ⋮ Ramsey Graphs and Block Designs. I ⋮ Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs ⋮ Generalised Ramsey numbers for small graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A partition calculus in set theory
• On Sets of Acquaintances and Strangers at any Party
• Edge-Disjoint Spanning Trees of Finite Graphs
• On Chromatic Bipartite Graphs
• On Finite Polarized Partition Relations
• On Subgraphs of the Complete Bipartite Graph
• Some remarks on the theory of graphs
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: Generalized Ramsey theory for graphs. I: Diagonal numbers