Results 1  10
of
15,138
Ramsey Numbers for Cycles in Graphs
, 1973
"... ... integer m such that, for any partition (E1, E2) of the edges of K,,, , either G 1 is a subgraph of the graph induced by E1, or G2 is a subgraph of the graph induced by E2. We show that R(C „ , Cn) = 2n 1 if n is odd, R(Cs, C2,_,) = 2n I if n> r(2r 1), R(C„,C2,)=n+r1 if n>4r 2r+2, R( ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
... integer m such that, for any partition (E1, E2) of the edges of K,,, , either G 1 is a subgraph of the graph induced by E1, or G2 is a subgraph of the graph induced by E2. We show that R(C „ , Cn) = 2n 1 if n is odd, R(Cs, C2,_,) = 2n I if n> r(2r 1), R(C„,C2,)=n+r1 if n>4r 2r+2, R
Reopening the Convergence Debate: A new look at crosscountry growth empirics
 JOURNAL OF ECONOMIC GROWTH
, 1996
"... ..."
Term Rewriting Systems
, 1992
"... Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss Abstra ..."
Abstract

Cited by 613 (18 self)
 Add to MetaCart
Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss Abstract Reduction Systems
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
On CycleComplete Graph Ramsey Numbers
, 1978
"... A new upper bound is given for the cyclecomplete graph Ramsey number r(C,,,, K„), the smallest order for a graph which forces it to contain either a cycle of order m or a set of ri independent vertices. Then, another cyclecomplete graph Ramsey number is studied, namely r (:C,,,, K„) the smallest o ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
A new upper bound is given for the cyclecomplete graph Ramsey number r(C,,,, K„), the smallest order for a graph which forces it to contain either a cycle of order m or a set of ri independent vertices. Then, another cyclecomplete graph Ramsey number is studied, namely r (:C,,,, K„) the smallest
Planar Ramsey numbers for small graphs
 Congr. Numer
, 2005
"... Given two graphs G1 and G2, the planar Ramsey number PR(G1, G2) is the smallest integer n such that every planar graph on n vertices either contains a copy of G1 or its complement contains a copy of G2. So far, the planar Ramsey numbers have been determined, when both, G1 and G2 are complete graphs ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
or both are cycles. By combining computer search with some theoretical results, in this paper we compute most of the planar Ramsey numbers PR(G1, G2), where each of G1 and G2 is a complete graph, a cycle or a complete graph without one edge. 1
Optimal taxation of capital income in general equilibrium with infinite lives
 Econometrica
, 1986
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 464 (0 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 455 (100 self)
 Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely
On geometric graph Ramsey numbers
"... Abstract. For any twocolouring of the segments determined by 3n − 3 points in general position in the plane, either the first colour class contains a triangle, or there is a noncrossing cycle of length n in the second colour class, and this result is tight. We also give a series of more general est ..."
Abstract
 Add to MetaCart
estimates on offdiagonal geometric graph Ramsey numbers in the same spirit. Finally we investigate the existence of large noncrossing monochromatic matchings in multicoloured geometric graphs.
Results 1  10
of
15,138