Results 11 to 20 of about 199,964 (159)
On the use of senders in generalized ramsey theory for graphs
Discrete Mathematics, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burr, Stefan A +2 more
openaire +2 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,
S. Burr
openaire +3 more sources
Generalized Ramsey theory and decomposable properties of graphs
Discussiones Mathematicae Graph Theory, 1999 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.
Burr, Stefan A. +3 more
openaire +2 more sources
Generalization of Ramsey Number for Cycle with Pendant Edges
MathematicsThis 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 +2 more sources
Generalized Ramsey theory. IX. Isomorphic factorizations. IV. Isomorphic Ramsey numbers [PDF]
Pacific Journal of Mathematics, 1979 Harary, Frank, Robinson, Robert W.
openaire +3 more sources
Generalized Ramsey theory for graphs. III. Small off-diagonal numbers [PDF]
Pacific Journal of Mathematics, 1972 Chvátal, Václav, Harary, Frank
openaire +4 more sources
Ramsey Theory Problems over the Integers: Avoiding Generalized Progressions [PDF]
, 2017 Two well studied Ramsey-theoretic problems consider subsets of the natural numbers which either contain no three elements in arithmetic progression, or in geometric progression. We study generalizations of this problem, by varying the kinds of progressions to be avoided and the metrics used to evaluate the density of the resulting subsets. One can view
Best, Andrew +6 more
openaire +3 more sources
Testing Closeness of Multivariate Distributions via Ramsey Theory [PDF]
Symposium on the Theory of Computing, 2023 We investigate the statistical task of closeness (or equivalence) testing for multidimensional distributions. Specifically, given sample access to two unknown distributions p, q on d, we want to distinguish between the case that p=q versus ||p−q||Ak > є,
Ilias Diakonikolas +2 more
semanticscholar +1 more source
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
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