Sciweavers

ENDM
2002
86views more  ENDM 2002»
14 years 11 days ago
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree
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
BSL
2000
153views more  BSL 2000»
14 years 12 days ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
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
COMBINATORICS
2006
99views more  COMBINATORICS 2006»
14 years 19 days ago
Hard Squares with Negative Activity and Rhombus Tilings of the Plane
Let Sm,n be the graph on the vertex set Zm
Jakob Jonsson