Sciweavers

CPC
2008
86views more  CPC 2008»
13 years 9 months ago
Enumeration Schemes for Restricted Permutations
Abstract. Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply...
Vincent Vatter
CPC
2008
157views more  CPC 2008»
13 years 10 months ago
The Critical Phase for Random Graphs with a Given Degree Sequence
Mihyun Kang, Taral Guldahl Seierstad
CPC
2008
60views more  CPC 2008»
13 years 11 months ago
On the Maximum Degree of a Random Planar Graph
Colin McDiarmid, Bruce A. Reed
CPC
2008
135views more  CPC 2008»
13 years 11 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
CPC
2008
67views more  CPC 2008»
13 years 11 months ago
Projecting Difference Sets on the Positive Orthant
Ron Holzman, Vsevolod F. Lev, Rom Pinchasi
CPC
2008
51views more  CPC 2008»
13 years 11 months ago
Winning Fast in Sparse Graph Construction Games
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
Ohad N. Feldheim, Michael Krivelevich
CPC
2008
112views more  CPC 2008»
13 years 11 months ago
When is an Almost Monochromatic K4 Guaranteed?
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...
Alexandr V. Kostochka, Dhruv Mubayi
CPC
2008
55views more  CPC 2008»
13 years 11 months ago
An Elementary Construction of Constant-Degree Expanders
Noga Alon, Oded Schwartz, Asaf Shapira