Sciweavers

CPC
2008
43views more  CPC 2008»
13 years 11 months ago
Generating All Sets With Bounded Unions
Yannick Frein, Benjamin Lévêque, Andr...
CPC
2008
43views more  CPC 2008»
13 years 11 months ago
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
Luke Kelly, Daniela Kühn, Deryk Osthus
CPC
2008
67views more  CPC 2008»
13 years 11 months ago
On the Strong Chromatic Number of Random Graphs
Po-Shen Loh, Benny Sudakov
CPC
2008
53views more  CPC 2008»
13 years 11 months ago
G-Intersection Theorems for Matchings and Other Graphs
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
CPC
2008
65views more  CPC 2008»
13 years 11 months ago
The Distribution of Patterns in Random Trees
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...
CPC
2008
48views more  CPC 2008»
13 years 11 months ago
Linkedness and Ordered Cycles in Digraphs
Daniela Kühn, Deryk Osthus
CPC
2008
57views more  CPC 2008»
13 years 11 months ago
On the Minimal Density of Triangles in Graphs
Alexander A. Razborov
CPC
2008
74views more  CPC 2008»
13 years 11 months ago
An Analysis of the Height of Tries with Random Weights on the Edges
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
CPC
2008
50views more  CPC 2008»
13 years 11 months ago
Quasirandom Groups
W. T. Gowers
CPC
2008
54views more  CPC 2008»
13 years 11 months ago
Sums of Dilates
Boris Bukh