AbstractA counting argument is developed and divisibility properties of the binomial coefficients are combined to prove, among other results, that[formula]whereKn, resp.Kkn, is the complete, resp. completek-uniform, hypergaph andR(Kn,Zp),R(Kkn,Z2) are the corresponding zero-sum Ramsey numbers
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
AbstractBoza et al. [L. Boza, M. Cera, P. García-Vázquez, M.P. Revuelta, On the Ramsey numbers for s...
A sequence of positive integers $A$ is said to be entirely Ramsey complete if, for any two-colouring...
AbstractTheorem. Let G be a graph on n vertices and an even number of edges. Then the zero-sum (mod ...
Let n, r and k be positive integers such that k|(nr). There exists a constant c(k,r) such that for f...
AbstractZero-sum Ramsey theory is a newly established area in combinatorics. It brings to ramsey the...
Let G be a bipartite graph, with k | e(G). The zero-sum bipartite Ramsey number B(G,Zk) is the small...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
This MSc thesis deals with a theory, which comes from combinatorics. According to Ramsey's theorem f...
AbstractThe Ramsey numbers r(mK4, nK3), where mK4 consists of m disjoint complete quadrangles and nK...
A practical number is a positive integer n such that every positive integer less than n can be writt...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
AbstractSimple proofs are given for three infinite classes of zero-sum Ramsey numbers modulo 3:r(Kn,...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
AbstractBoza et al. [L. Boza, M. Cera, P. García-Vázquez, M.P. Revuelta, On the Ramsey numbers for s...
A sequence of positive integers $A$ is said to be entirely Ramsey complete if, for any two-colouring...
AbstractTheorem. Let G be a graph on n vertices and an even number of edges. Then the zero-sum (mod ...
Let n, r and k be positive integers such that k|(nr). There exists a constant c(k,r) such that for f...
AbstractZero-sum Ramsey theory is a newly established area in combinatorics. It brings to ramsey the...
Let G be a bipartite graph, with k | e(G). The zero-sum bipartite Ramsey number B(G,Zk) is the small...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
This MSc thesis deals with a theory, which comes from combinatorics. According to Ramsey's theorem f...
AbstractThe Ramsey numbers r(mK4, nK3), where mK4 consists of m disjoint complete quadrangles and nK...
A practical number is a positive integer n such that every positive integer less than n can be writt...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
AbstractSimple proofs are given for three infinite classes of zero-sum Ramsey numbers modulo 3:r(Kn,...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
AbstractBoza et al. [L. Boza, M. Cera, P. García-Vázquez, M.P. Revuelta, On the Ramsey numbers for s...
A sequence of positive integers $A$ is said to be entirely Ramsey complete if, for any two-colouring...
DOI
Add to ORKG