Results 1 to 10 of about 1,368 (181)
Generalized Ramsey theory for multiple colors
Journal of Combinatorial Theory Series B, 1976 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C C Rousseau
exaly +3 more sources
Ramsey theory on generalized Baire space [PDF]
Topology and Its Applications, 2018 12 ...
Dan Hathaway
exaly +5 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.
Maria Axenovich +2 more
exaly +4 more sources
What can we hope to accomplish in generalized Ramsey theory?
Discrete Mathematics, 1987 Let F, G, and H denote graphs. We write \(F\to (G,H)\) to mean that, however the edges of F are colored red and blue, either the red subgraph of F contains a copy of G or the blue subgraph of F contains a copy of H. We write \(r(G,H)=t\) if \(K_ t\to (G,H)\) but \(K_{t-1}\nrightarrow (G,H)\); r(G,H) is called the Ramsey number of G and H. In this paper,
Stefan A Burr
exaly +3 more sources
Generalized Ramsey theory. IX. Isomorphic factorizations. IV. Isomorphic Ramsey numbers [PDF]
Pacific Journal of Mathematics, 1979 Harary Frank
exaly +3 more sources
Generalized Ramsey theory for graphs. III. Small off-diagonal numbers [PDF]
Pacific Journal of Mathematics, 1972 Harary Frank
exaly +4 more sources
Capacity of Spaces of Properties Formulae, Approximations and Qualitative Shapes
Mendel, 2018 This article focuses on the exploration of spaces and models in which we describe the behavior of complex systems as special shapes. We understand these shapes both as a configuration of properties and their values, and on the other, as the formation of ...
Jiri Bila
doaj +1 more source
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 +1 more source
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 +1 more source
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
Discussiones Mathematicae Graph Theory, 2013 Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás.
Krop Elliot, Krop Irina
doaj +1 more source