CPC 2008 | Sciweavers

If G is a graph with vertex set [n] then A 2[n] is G-intersecting if for all A, B A either A B = or there exist a A and b B such that a G b. The question of how large a k-un...

J. Robert Johnson, John M. Talbot

claim paper

Read More »

18

click to vote

CPC
2008

65views more CPC 2008»

The Distribution of Patterns in Random Trees

13 years 7 months ago

Download www.dmg.tuwien.ac.at

Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finite, unlabeled) tree. Assuming that every tree of Tn is equally likely, it is shown that the...

Frédéric Chyzak, Michael Drmota, Tho...

claim paper

Read More »

8

click to vote

CPC
2008

48views more CPC 2008»

Linkedness and Ordered Cycles in Digraphs

13 years 7 months ago

Download web.mat.bham.ac.uk

Daniela Kühn, Deryk Osthus

claim paper

Read More »

10

click to vote

CPC
2008

57views more CPC 2008»

On the Minimal Density of Triangles in Graphs

13 years 7 months ago

Download www.mi.ras.ru

Alexander A. Razborov

claim paper

Read More »

25

click to vote

CPC
2008

74views more CPC 2008»

An Analysis of the Height of Tries with Random Weights on the Edges

13 years 7 months ago

Download cg.scs.carleton.ca

We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...

Nicolas Broutin, Luc Devroye

claim paper

Read More »

6

click to vote

CPC
2008

50views more CPC 2008»

Quasirandom Groups

13 years 7 months ago