Sciweavers

34

ENDM
2002

86views more ENDM 2002»

Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree

13 years 11 months ago

Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree

Download ajc.maths.uq.edu.au

Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...

Stanislav Jendrol, Heinz-Jürgen Voss

claim paper

Read More »

38

BSL
2000

153views more BSL 2000»

Combinatorics with definable sets: Euler characteristics and Grothendieck rings

13 years 11 months ago

Combinatorics with definable sets: Euler characteristics and Grothendieck rings

Download math.berkeley.edu

We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...

Jan Krajícek, Thomas Scanlon

claim paper

Read More »

38

COMBINATORICS
2006

99views more COMBINATORICS 2006»

Hard Squares with Negative Activity and Rhombus Tilings of the Plane

13 years 11 months ago

Hard Squares with Negative Activity and Rhombus Tilings of the Plane

Download www.combinatorics.org

Let Sm,n be the graph on the vertex set Zm

Jakob Jonsson

claim paper

Read More »