Results 11 to 20 of about 1,045 (103)
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
On the use of senders in generalized ramsey theory for graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan A. Burr +2 more
openaire +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 (
Chvátal, Václav, Harary, Frank
openaire +1 more source
Generalized Ramsey theory and decomposable properties of graphs
Summary: We translate Ramsey-type problems into the language of decomposable hereditary properties of graphs. We prove a distributive law for reducible and decomposable properties of graphs. Using it we establish some values of graph theoretical invariants of decomposable properties and show their correspondence to generalized Ramsey numbers.
Stefan A. Burr +3 more
openaire +1 more source
Generalization of Ramsey Number for Cycle with Pendant Edges
This paper explores various Ramsey numbers associated with cycles with pendant edges, including the classical Ramsey number, the star-critical Ramsey number, the Gallai–Ramsey number, and the star-critical Gallai–Ramsey number.
Jagjeet Jakhar +5 more
doaj +1 more source
On a generalization of Ramsey theory
AbstractIn [2, 3], Chung and Liu introduce the following generalization of Ramsey Theory for graphs.
openaire +2 more sources
Rainbow generalizations of Ramsey theory - a dynamic survey
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs.
Fujita, Shinya +3 more
openaire +4 more sources
Generalized ramsey theory for graphs, x: double stars
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 +2 more sources
Monochromatic Sums and Products of Polynomials
Monochromatic sums and products of polynomials, Discrete Analysis 2024:5, 7 pp. An early result in Ramsey theory, Schur's theorem, states that if the positive integers are finitely coloured, then there will always be $x$ and $y$ such that $x,y$ and $x ...
Ryan Alweiss
doaj +1 more source

