CPC 2008 | Sciweavers

22

CPC
2008

86views more CPC 2008»

Enumeration Schemes for Restricted Permutations

13 years 6 months ago

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

claim paper

Read More »

25

click to vote

CPC
2008

157views more CPC 2008»

The Critical Phase for Random Graphs with a Given Degree Sequence

13 years 7 months ago

Download folk.uio.no

Mihyun Kang, Taral Guldahl Seierstad

claim paper

Read More »

17

click to vote

CPC
2008

60views more CPC 2008»

On the Maximum Degree of a Random Planar Graph

13 years 7 months ago

Download cgm.cs.mcgill.ca

Colin McDiarmid, Bruce A. Reed

claim paper

Read More »

20

click to vote

CPC
2008

76views more CPC 2008»

Enumerating Contingency Tables via Random Permanents

13 years 7 months ago

Download www.math.lsa.umich.edu

Alexander I. Barvinok

claim paper

Read More »

20

click to vote

CPC
2008

63views more CPC 2008»

The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights

13 years 7 months ago

Download www.nas.its.tudelft.nl

Gerard Hooghiemstra, Piet Van Mieghem

claim paper

Read More »

23

click to vote

CPC
2008

135views more CPC 2008»

Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations

13 years 7 months ago

Download jupiter.math.nctu.edu.tw

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

claim paper

Read More »

16

click to vote

CPC
2008

67views more CPC 2008»

Projecting Difference Sets on the Positive Orthant

13 years 7 months ago

Download www.math.technion.ac.il

Ron Holzman, Vsevolod F. Lev, Rom Pinchasi

claim paper

Read More »

21

click to vote

CPC
2008

51views more CPC 2008»

Winning Fast in Sparse Graph Construction Games

13 years 7 months ago

Download www.cs.tau.ac.il

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

claim paper

Read More »

19

click to vote

CPC
2008

112views more CPC 2008»

When is an Almost Monochromatic K4 Guaranteed?

13 years 7 months ago

Download www.math.uic.edu

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

claim paper

Read More »

15

click to vote

CPC
2008

55views more CPC 2008»

An Elementary Construction of Constant-Degree Expanders

13 years 7 months ago