Results 1 to 10 of about 199,964 (159)
Generalized Ramsey theory for graphs [PDF]
Bulletin of the American Mathematical Society, 1972 The classical Ramsey numbers [7] involve the occurrence of monochromatic complete subgraphs in line-colored complete graphs. By removing the completeness requirements and admitting arbitrary forbidden subgraphs within any given graph, the situation is ...
Chvátal, Václav, Harary, Frank
openaire +4 more sources
Generalized Ramsey theory VI: Ramsey numbers for small plexes [PDF]
Journal of the Australian Mathematical Society, 1976 AbstractGeneralized Ramsey theory for graphs was formulated and developed in the previous papers in this series. We extend the area here by introducing generalized Ramsey numbers for higher dimensional simplicial complexes. In particular we calculate explicitly the Ramsey numbers for several small “pure 2-complexes”, or more brieflyplexes, in which ...
Richard A. Duke, Frandk Harary
openaire +2 more sources
Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets [PDF]
Glasgow Mathematical Journal, 1981 Following the notation in Faudree and Schelp [3], we write G → (F, H) to mean that every 2-coloring of E(G), the edge set of G, contains a green (the first color) F or a red (the second color) H. Then the Ramsey number r(F, H) of two graphs F and H with no isolated vertices has been defined as the minimum p such that Kp → (F, H).
Harary, Frank +2 more
openaire +2 more sources
On Generalized Ramsey Theory: The Bipartite Case
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Axenovich, Maria +2 more
openaire +3 more sources
Generalized Ramsey theory for graphs. II. Small diagonal numbers [PDF]
Proceedings of the American Mathematical Society, 1972 Consider a finite nonnull graph G with no loops or multiple edges and no isolated points. Its Ramsey number r ( G ) r(G) is defined as the minimum number p such that every 2-coloring of the lines of the complete graph K p {K_p} must contain a ...
Chvátal, Václav, Harary, Frank
openaire +2 more sources
Generalized ramsey theory for graphs, x: double stars
Discrete Mathematics, 1979 AbstractThe double star S(n, m), where n ⩾ m ⩾ 0, is the graph consisting of the union of two stars K1,n and K1,m together with a line joining their centers. Its ramsey number r(S(n, m)) is the least number p such that there is a monochromatic copy of S(n, m) in any 2-coloring of the edges of Kp.
Grossman, Jerrold W. +2 more
openaire +3 more sources
Ramsey theory on generalized Baire space [PDF]
Topology and its Applications, 2018 12 ...
Dan Hathaway
openaire +5 more sources
Generalized Ramsey theory for multiple colors
Journal of Combinatorial Theory, Series B, 1976 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdös, P +3 more
openaire +2 more sources
Corrections : Generalized Ramsey Theory for Graphs V [PDF]
Bulletin of the London Mathematical Society, 1975 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/135328/1/blms0087 ...
Harary, Frank, Hell, Pavol
openaire +3 more sources
Generalized ramsey theory for graphs, I. Diagonal numbers [PDF]
Periodica Mathematica Hungarica, 1973 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/43187/1/10998_2005_Article_BF02018466 ...
Chvátal, V., Harary, Frank
openaire +4 more sources