Sciweavers

3267 search results - page 155 / 654
» Generalized quasirandom graphs
Sort
View
EJC
2006
15 years 4 months ago
Homomorphism bounded classes of graphs
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...
Timothy Marshall, Reza Nasraser, Jaroslav Nesetril
COMBINATORICS
2000
142views more  COMBINATORICS 2000»
15 years 4 months ago
Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials
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...
Alexei Borodin, Grigori Olshanski
ENTCS
2002
118views more  ENTCS 2002»
15 years 4 months ago
Rank 2 Types for Term Graph Rewriting
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...
Steffen van Bakel
SEMWEB
2005
Springer
15 years 10 months ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
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...
Herman J. ter Horst
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 4 months ago
Positive circuits and maximal number of fixed points in discrete dynamical systems
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...
Adrien Richard