Results 11 to 20 of about 52 (52)
Veterinary Dermatology, Volume 32, Issue 6, Page 668-e178, December 2021., 2021 Background Antimicrobial resistance in Staphylococcus pseudintermedius (SP) and the prevalence of meticillin‐resistant SP (MRSP) is increasing in dogs worldwide. Objectives To evaluate the influence of hospital size on antimicrobial resistance of SP and whether restricted use of antimicrobials based on antibiograms could reduce the identification of ...
Keita Iyori +5 more
wiley +1 more source
Bohr Topologies and Partition Theorems for Vector Spaces [PDF]
, 1997 We prove a Ramsey-style theorem for sequences of vectors in an infinite-dimensional vector space over a finite field. As an application of this theorem, we prove that there are countably infinite Abelian groups whose Bohr topologies are not homeomorphic.
Kenneth Kunen, Kunen, Kenneth
core +1 more source
A linear upper bound in zero‐sum Ramsey theory
International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 3, Page 609-612, 1994., 1994 Let n, r and k be positive integers such that . There exists a constant c(k, r) such that for fixed k and r and for every group A of order k where is the zero‐sum Ramsey number introduced by Bialostocki and Dierker [1], and is the complete r‐uniform hypergraph on n‐vertices.
Yair Caro
wiley +1 more source
Zero‐sum partition theorems for graphs
International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 4, Page 697-702, 1994., 1993 Let q = pn be a power of an odd prime p. We show that the vertices of every graph G can be partitioned into t(q) classes such that the number of edges in any induced subgraph 〈Vi〉 is divisible by q, where , and if q = 2n, then t(q) = 2q − 1. In particular, it is shown that t(3) = 3 and 4 ≤ t(5) ≤ 5.
Y. Caro, I. Krasikov, Y. Roditty
wiley +1 more source
A monotone path in an edge‐ordered graph
International Journal of Mathematics and Mathematical Sciences, Volume 10, Issue 2, Page 315-320, 1987., 1986 An edge‐ordered graph is an ordered pair (G, f), where G is a graph and f is a bijective function, f : E(G) → {1, 2, …, |E(G)|}. A monotone path of length k in (G, f) is a simple path Pk+1 : v1v2 … vk+1 in G such that either f({vi, vi+1}) < f({vi+1, vi+2}) or f({vi, vi+1}) > f({vi+1, vi}) for i = 1, 2, …, k − 1.
A. Bialostocki, Y. Roditty
wiley +1 more source
A Note on Upper Bounds for Some Generalized Folkman Numbers
Discussiones Mathematicae Graph Theory, 2019 We present some new constructive upper bounds based on product graphs for generalized vertex Folkman numbers. They lead to new upper bounds for some special cases of generalized edge Folkman numbers, including the cases Fe(K3, K4 − e; K5) ≤ 27 and Fe(K4 −
Xu Xiaodong +2 more
doaj +1 more source
A Note on Lower Bounds for Induced Ramsey Numbers
Discussiones Mathematicae Graph Theory, 2019 We say that a graph F strongly arrows a pair of graphs (G,H) and write F →ind$\mathop \to \limits^{{\rm{ind}}} $(G,H) if any 2-coloring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F.
Gorgol Izolda
doaj +1 more source
Ramsey Properties of Random Graphs and Folkman Numbers
Discussiones Mathematicae Graph Theory, 2017 For two graphs, G and F, and an integer r ≥ 2 we write G → (F)r if every r-coloring of the edges of G results in a monochromatic copy of F. In 1995, the first two authors established a threshold edge probability for the Ramsey property G(n, p) → (F)r ...
Rödl Vojtěch +2 more
doaj +1 more source
A Note on the Ramsey Number of Even Wheels Versus Stars
Discussiones Mathematicae Graph Theory, 2018 For two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N, such that for any graph on N vertices, either G contains G1 or Ḡ contains G2. Let Sn be a star of order n and Wm be a wheel of order m + 1.
Haghi Sh., Maimani H.R.
doaj +1 more source
Another View of Bipartite Ramsey Numbers
Discussiones Mathematicae Graph Theory, 2018 For bipartite graphs F and H and a positive integer s, the s-bipartite Ramsey number BRs(F,H) of F and H is the smallest integer t with t ≥ s such that every red-blue coloring of Ks,t results in a red F or a blue H.
Bi Zhenming, Chartrand Gary, Zhang Ping
doaj +1 more source