Sciweavers

7840 search results - page 162 / 1568
» On generalized Ramsey numbers
Sort
View
90
Voted
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
15 years 23 days ago
Classifying Descents According to Equivalence mod k
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
Sergey Kitaev, Jeffrey B. Remmel
125
Voted
COMGEO
2006
ACM
15 years 23 days ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy
CPC
2006
93views more  CPC 2006»
15 years 23 days ago
Distribution of Vertex Degree in Web-Graphs
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
Colin Cooper
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 21 days ago
Minimum cost distributed source coding over a network
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
Aditya Ramamoorthy
113
Voted
CPC
2007
101views more  CPC 2007»
15 years 21 days ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
Lingsheng Shi, Nicholas C. Wormald