Sciweavers

3268 search results - page 45 / 654
» The hub number of a graph
Sort
View
TIT
2011
116views more  TIT 2011»
14 years 9 months ago
On the Number of Errors Correctable with Codes on Graphs
Alexander Barg, Arya Mazumdar
DM
1998
118views more  DM 1998»
15 years 1 months ago
Chromatic Ramsey numbers
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
Xuding Zhu
COMBINATORICA
2006
91views more  COMBINATORICA 2006»
15 years 2 months ago
The Number Of Orientations Having No Fixed Tournament
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...
Noga Alon, Raphael Yuster