output
19922026
Showing 2011Show all

34 papers · 1 filter

math.CO2011

Degrees in oriented hypergraphs and Ramsey p-chromatic number

Yair Caro, Adriana Hansberg

The family of graphs having an orientation such that for every vertex either (outdegree) or (indegree) have been investigated re…

math.AT2011

Generic singular configurations of linkages

David Blanc, Nir Shvalb

We study the topological and differentiable singularities of the configuration space C(Γ) of a mechanical linkage Γin d-dimensional Euclidean space, defining an inductive sufficien…

cs.DS2011

Approximating the Diameter of Planar Graphs in Near Linear Time

Oren Weimann, Raphael Yuster

We present a -approximation algorithm running in time for finding the diameter of an undirected planar graph with non-negative edge lengths.

math.CT2011★ 25 cited

Locally class-presentable and class-accessible categories

Boris Chorny, Jiri Rosicky

We generalize the concepts of locally presentable and accessible categories. Our framework includes such categories as small presheaves over large categories and ind-categories. Th…

math.QA2011★ 12 cited

Higher pentagram maps, weighted directed networks, and cluster dynamics

Michael Gekhtman, Michael Shapiro, Serge Tabachnikov +1

The pentagram map that associates to a projective polygon a new one formed by intersections of short diagonals was introduced by R. Schwartz and was shown to be integrable by V. Ov…

math.CO2011★ 3 cited

Interval Graphs with Containment Restrictions

Jeffrey Beyerl, Robert E. Jamison

An interval graph is proper iff it has a representation in which no interval contains another. Fred Roberts characterized the proper interval graphs as those containing no induced…