output
20032005
most citedDense graphs are antimagic

105 citations

21 papers

math.LO2005

A question of van den Dries and a theorem of Lipshitz and Robinson: Not everything is standard

Ehud Hrushovski, Ya'acov Peterzil

We use a new construction of an o-minimal structure, due to Lipshitz and Robinson, to answer a question of van den Dries regarding the relationship between arbitrary o-minimal expa…

cs.DM20053 cited

Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs

G. Gutin, A. Rafiey, A. Yeo

For digraphs and , a mapping $f: V(D)\dom V(H)$ is a {\em homomorphism of to } if implies For a fixed directed or undirected graph $H…

cs.DM2005

Minimum Cost and List Homomorphisms to Semicomplete Digraphs

G. Gutin, A. Rafiey, A. Yeo

The following optimization problem was introduced in \cite{gutinDAM}, where it was motivated by a real-world problem in defence logistics. Suppose we are given a pair of digraphs $…

math.NT20051 cited

Critical pairs in abelian groups and Kemperman's structure theorem

Vsevolod F. Lev

A well-known result by Kemperman describes the structure of those pairs (A,B) of finite subsets of an abelian group satisfying |A+B|\le|A|+|B|-1. We establish a description which i…

nlin.AO2005

On the mobility and efficiency of mechanical systems

G. Wolansky

The definition of a mobilized system and its efficiency are introduced. The existence of an optimal (maximally efficient) system is proved by an application of Young measures and c…

math.CO20051 cited

Matchings Avoiding Partial Patterns

William Y. C. Chen, Toufik Mansour, Sherry H. F. Yan

We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on th…