Generalized Ramsey theory for graphs. I: Diagonal numbers

DOI10.1007/BF02018466MaRDI QIDQ2558865zbMATH OpenOpenAlexFDO

Authors Vašek Chvátal, Frank Harary

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

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

Cites work

• A partition calculus in set theory
• Combinatorial Relations and Chromatic Graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• scientific article; zbMATH DE number 3296261 (Why is no real title available?)
• scientific article; zbMATH DE number 3402652 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• On Chromatic Bipartite Graphs
• On Finite Polarized Partition Relations
• On Sets of Acquaintances and Strangers at any Party
• On Subgraphs of the Complete Bipartite Graph
• Some remarks on the theory of graphs

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2558865)