Ramsey Numbers for Nontrivial Berge Cycles
Abstract
References
Recommendations
On Ramsey numbers of 3-uniform Berge cycles
AbstractFor an arbitrary graph G, a hypergraph H is called Berge-G if there is an injection i : V ( G ) ⟶ V ( H ) and a bijection ψ : E ( G ) ⟶ E ( H ) such that for each e = u v ∈ E ( G ), we have { i ( u ) , i ( v ) } ⊆ ψ ( e ). We denote by B r G, the ...
On Some Ramsey Numbers for Quadrilaterals Versus Wheels
For given graphs G 1 and G 2, the Ramsey number R ( G 1, G 2) is the least integer n such that every 2-coloring of the edges of K n contains a subgraph isomorphic to G 1 in the first color or a subgraph isomorphic to G 2 in the ...
More Constructive Lower Bounds on Classical Ramsey Numbers
We present several new constructive lower bounds for classical Ramsey numbers. In particular, the inequality $R(k,s+1) \geq R(k,s)+2k-2$ is proved for $k \geq 5$. The general construction permits us to prove that, for all integers $k$, $l$, with $k \geq ...
Comments
Information & Contributors
Information
Published In
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Author Tags
Author Tag
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in