Results 151 to 160 of about 1,368 (181)

The myth of the Bayesian brain. [PDF]

Eur J Appl Physiol
Mangalam M.
europepmc   +1 more source

Navigating Ghana's economic waters: Exploring the impact of Fiscal and Monetary policies on stock market performance. [PDF]

Heliyon
Cobbinah BB, Wen Y, Sarpong FA.
europepmc   +1 more source

A survey of generalized ramsey theory

Lecture Notes in Mathematics, 1974
This is a progress report on a very dynamic branch of graph theory. We begin with a historical review of the origins of generalized ramsey theory and then indicate the small graphs for which the diagonal ramsey numbers are now known. The ramsey multiplicity of a graph is taken up and applied to ramsey games. We conclude with a listing of those families
Harary Frank
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

An application of the regularity lemma in generalized Ramsey theory

Journal of Graph Theory, 2003
AbstractGiven graphs G and H, an edge coloring of G is called an (H,q)‐coloring if the edges of every copy of H ⊂ G together receive at least q colors. Let r(G,H,q) denote the minimum number of colors in a (H,q)‐coloring of G. In 9 Erdős and Gyárfás studied r(Kn,Kp,q) if p and q are fixed and n tends to infinity.
Gabor N Sarkozy, Stanley M Selkow
exaly   +2 more sources

Rainbow Generalizations of Ramsey Theory: A Survey

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shinya Fujita, Colton Magnant, Kenta Ozeki   +2 more
exaly   +3 more sources

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph

Networks, 1974
AbstractA Proper graph G has no isolated points. Its Ramsey number r(G) is the minimum p such that every 2‐coloring of the edges of Kp contains a monochromatic G. The Ramsey multiplicity R(G) is the minimum number of monochromatic G in any 2‐coloring of Kr(G). With just one exception, namely K4, we determine R(G) for proper graphs with at most 4 points.
F Harary
exaly   +3 more sources

Recent results on generalized Ramsey theory for graphs

Lecture Notes in Mathematics, 1972
Virtually all of the known results on generalized Ramsey theory for graphs have been reported here, and the most general method of proof was brute force. There is certainly a need for more powerful and general methods, but it is not certain that these exist.
Harary Frank
exaly   +2 more sources

Generalized ramsey theory for graphs - a survey

, 1974
Almost nonexistent a few years ago, the field of generalized Ramsey theory for graphs is now being pursued very actively and with remarkable success. This survey paper will emphasize the following class of problems: Given graphs G1, ..., Gc, determine or estimate the Ramsey number r(G1, ..., Gc), the smallest number p such that if the lines of a ...
Stefan A. Burr
openaire   +2 more sources