scholarly journals On the Multi-Colored Ramsey Numbers of Paths and Even Cycles

10.37236/5663 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Gábor N. Sárközy
Keyword(s):  
Upper Bound ◽  
Main Tool ◽  
Independent Interest ◽  
Ramsey Numbers

In this paper we improve the upper bound on the multi-color Ramsey numbers of paths and even cycles. More precisely, we prove the following. For every $r\geq 2$ there exists an $n_0=n_0(r)$ such that for $n\geq n_0$ we have $$R_r(P_n) \leq \left( r - \frac{r}{16r^3+1} \right) n.$$ For every $r\geq 2$ and even $n$ we have $$R_r(C_n) \leq \left( r - \frac{r}{16r^3+1} \right) n + o(n) \text{ as }n\rightarrow \infty.$$ The main tool is a stability version of the Erdős-Gallai theorem that may be of independent interest.

scholarly journals A strict upper bound for size multipartite Ramsey numbers of paths versus stars

2017 ◽  
Vol 1 (2) ◽  
pp. 9
Author(s):  
Chula Jayawardene
Keyword(s):  
Natural Number ◽  
Complete Graph ◽  
Upper Bound ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Infinite Class ◽  
Ramsey Numbers ◽  
Necessary And Sufficient

<p>Let $P_n$ represent the path of size $n$. Let $K_{1,m-1}$ represent a star of size $m$ and be denoted by $S_{m}$. Given a two coloring of the edges of a complete graph $K_{j \times s}$ we say that $K_{j \times s}\rightarrow (P_n,S_{m+1})$ if there is a copy of $P_n$ in the first color or a copy of $S_{m+1}$ in the second color. The size Ramsey multipartite number $m_j(P_n, S_{m+1})$ is the smallest natural number $s$ such that $K_{j \times s}\rightarrow (P_n,S_{m+1})$. Given $j,n,m$ if $s=\left\lceil \dfrac{n+m-1-k}{j-1} \right\rceil$, in this paper, we show that the size Ramsey numbers $m_j(P_n,S_{m+1})$ is bounded above by $s$ for $k=\left\lceil \dfrac{n-1}{j} \right\rceil$. Given $j\ge 3$ and $s$, we will obtain an infinite class $(n,m)$ that achieves this upper bound $s$. In the later part of the paper, will also investigate necessary and sufficient conditions needed for the upper bound to hold.</p>

scholarly journals An upper bound for Ramsey numbers

1966 ◽  
Vol 72 (6) ◽  
pp. 1076-1080 ◽  
Author(s):  
Jack E. Graver ◽  
James Yackel
Keyword(s):  
Upper Bound ◽  
Ramsey Numbers

scholarly journals Covering and tiling hypergraphs with tight cycles

2020 ◽  
pp. 1-42
Author(s):  
Jie Han ◽  
Allan Lo ◽  
Nicolás Sanhueza-Matamala
Keyword(s):  
Main Tool ◽  
Independent Interest ◽  
Uniform Hypergraph ◽  
Uniform Hypergraphs ◽  
Vertex Disjoint

Abstract A k-uniform tight cycle $C_s^k$ is a hypergraph on s > k vertices with a cyclic ordering such that every k consecutive vertices under this ordering form an edge. The pair (k, s) is admissible if gcd (k, s) = 1 or k / gcd (k,s) is even. We prove that if $s \ge 2{k^2}$ and H is a k-uniform hypergraph with minimum codegree at least (1/2 + o(1))|V(H)|, then every vertex is covered by a copy of $C_s^k$ . The bound is asymptotically sharp if (k, s) is admissible. Our main tool allows us to arbitrarily rearrange the order in which a tight path wraps around a complete k-partite k-uniform hypergraph, which may be of independent interest. For hypergraphs F and H, a perfect F-tiling in H is a spanning collection of vertex-disjoint copies of F. For $k \ge 3$ , there are currently only a handful of known F-tiling results when F is k-uniform but not k-partite. If s ≢ 0 mod k, then $C_s^k$ is not k-partite. Here we prove an F-tiling result for a family of non-k-partite k-uniform hypergraphs F. Namely, for $s \ge 5{k^2}$ , every k-uniform hypergraph H with minimum codegree at least (1/2 + 1/(2s) + o(1))|V(H)| has a perfect $C_s^k$ -tiling. Moreover, the bound is asymptotically sharp if k is even and (k, s) is admissible.

scholarly journals A Note on Odd Cycle-Complete Graph Ramsey Numbers

10.37236/1662 ◽  
2001 ◽  
Vol 9 (1) ◽  
Author(s):  
Benny Sudakov
Keyword(s):  
Positive Integer ◽  
Complete Graph ◽  
Upper Bound ◽  
Short Note ◽  
Ramsey Number ◽  
Ramsey Numbers ◽  
Odd Cycle

The Ramsey number $r(C_l, K_n)$ is the smallest positive integer $m$ such that every graph of order $m$ contains either cycle of length $l$ or a set of $n$ independent vertices. In this short note we slightly improve the best known upper bound on $r(C_l, K_n)$ for odd $l$.

scholarly journals Cyclic Flats of a Polymatroid

2020 ◽  
Vol 24 (4) ◽  
pp. 637-648
Author(s):  
Laszlo Csirmaz
Keyword(s):  
Main Tool ◽  
Rank Function ◽  
Independent Interest ◽  
Discrete Measure

Abstract Polymatroids can be considered as “fractional matroids” where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a polymatroid carefully, the characterization by Bonin and de Mier of the ranked lattice of cyclic flats carries over to polymatroids. The main tool, which might be of independent interest, is a convolution-like method which creates a polymatroid from a ranked lattice and a discrete measure. Examples show the ease of using the convolution technique.

On radical extensions of rings

1967 ◽  
Vol 7 (4) ◽  
pp. 552-554 ◽  
Author(s):  
Efraim P. Armendariz
Keyword(s):  
Jacobson Radical ◽  
Main Tool ◽  
Independent Interest ◽  
Minimum Condition ◽  
Radical Extension ◽  
Commutativity Theorems

A ring K is a radical extension of a subring B if for each x ∈ K there is aninteger n = n(x) > 0 such that xn ∈ B. In [2] and [3], C. Faith considered radical extensions in connection with commutativity questions, as well as the generation of rings. In this paper additional commutativity theorems are established, and rings with right minimum condition are examined. The main tool is Theorem 1.1 which relates the Jacobson radical of K to that of B, and is of independent interest in itself. The author is indebted to the referee for his helpful suggestions, in particular for the strengthening of Theorem 2.1.

scholarly journals An upper bound for ramsey numbers

2004 ◽  
Vol 17 (6) ◽  
pp. 663-665 ◽  
Author(s):  
Yusheng Li ◽  
C.C Rousseau ◽  
Wenan Zang
Keyword(s):  
Upper Bound ◽  
Ramsey Numbers

scholarly journals New upper bound formulas with parameters for Ramsey numbers

2007 ◽  
Vol 307 (6) ◽  
pp. 760-763
Author(s):  
Yiru Huang ◽  
Yuandi Wang ◽  
Wancheng Sheng ◽  
Jiansheng Yang ◽  
Kemin Zhang ◽  
...  
Keyword(s):  
Upper Bound ◽  
Ramsey Numbers

scholarly journals An upper bound for the Ramsey numbers r(K3,G)

1994 ◽  
Vol 125 (1-3) ◽  
pp. 177-182 ◽  
Author(s):  
Wayne Goddard ◽  
Daniel J. Kleitman
Keyword(s):  
Upper Bound ◽  
Ramsey Numbers
Sign in / Sign up

Export Citation Format

Share Document