Asymptotic values of hypergraph Ramsey numbers for loose cycles (and paths) were determined recently. Here we determine some of them exactly, for example the 2-color hypergraph Ramsey number of aâ€¦ (More)

In this paper, the concept of broken diagonal pair in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-checkâ€¦ (More)

Boza et al. [L. Boza, M. Cera, P. GarcÃa-VÃ¡zquez, M.P. Revuelta, On the Ramsey numbers for stars versus complete graphs, European J. Combin. 31 (2010) 1680â€“1688] gave the exact value of theâ€¦ (More)

In this paper, some well-structured block designs are presented whose incidence matrices can be considered as the mother matrices of some regular and irregular column-weight three quasi cyclicâ€¦ (More)

In this paper, the concept of the broken diagonal pair in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as theâ€¦ (More)

Let G1, G2, . . . , Gt be graphs. The multicolor Ramsey number R(G1, G2, . . . , Gt) is the smallest positive integer n such that if the edges of a complete graph Kn are partitioned into t disjointâ€¦ (More)

Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths when one of the pathsâ€¦ (More)

For given bipartite graphsG1, G2, . . . , Gt, the bipartite Ramsey number bR(G1, G2, . . . , Gt) is the smallest integer n such that if the edges of the complete bipartite graph Kn,n are partitionedâ€¦ (More)