Results 1 to 10 of about 1,024 (103)
On Generalized Ramsey Theory: The Bipartite Case
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Axenovich, Maria +2 more
openaire +4 more sources
Ramsey theory on generalized Baire space [PDF]
12 ...
openaire +5 more sources
Generalized Ramsey theory for multiple colors
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdös, P +3 more
openaire +3 more sources
Generalized Ramsey theory VI: Ramsey numbers for small plexes [PDF]
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
Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets [PDF]
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
Corrections : Generalized Ramsey Theory for Graphs V [PDF]
Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/135328/1/blms0087 ...
Harary, Frank, Hell, Pavol
openaire +2 more sources
Generalized ramsey theory for graphs, I. Diagonal numbers [PDF]
Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/43187/1/10998_2005_Article_BF02018466 ...
Chvátal, V., Harary, Frank
openaire +3 more sources
Capacity of Spaces of Properties Formulae, Approximations and Qualitative Shapes
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. II. Small diagonal numbers [PDF]
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 +1 more source
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
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

