446 search results - page 15 / 90 » A Combinatorial Theorem for Trees |
131
click to vote
JCT
2006
15 years 6 months ago
2006
In 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2, . . . , vn; label t...
131
click to vote
COMBINATORICS
1998
15 years 5 months ago
1998
A q-Lagrange inversion theorem due to A. M. Garsia is proved by means of two sign-reversing, weight-preserving involutions on Catalan trees.
192
click to vote
SIAMDM
2010
15 years 21 days ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
164
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
154
click to vote
CIE
2009
Springer
16 years 16 days ago
2009
Springer
We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show th...