3267 search results - page 155 / 654 » Generalized quasirandom graphs |
128
click to vote
EJC
2006
15 years 6 months ago
2006
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...
170
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on th...
173
click to vote
ENTCS
2002
15 years 6 months ago
2002
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
160
click to vote
SEMWEB
2005
Springer
16 years 1 hour ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
182
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...