Sciweavers

COMBINATORICA
2006
52views more  COMBINATORICA 2006»
13 years 11 months ago
Expansion Of Product Replacement Graphs
Alexander Gamburd, Igor Pak
COMBINATORICA
2006
55views more  COMBINATORICA 2006»
13 years 11 months ago
Weighted Non-Trivial Multiply Intersecting Families
Peter Frankl, Norihide Tokushige
COMBINATORICA
2006
64views more  COMBINATORICA 2006»
13 years 11 months ago
On The Parameterized Intractability Of Motif Search Problems
ended abstract of this paper was presented at the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), Springer-Verlag, LNCS 2285, pages 262
Michael R. Fellows, Jens Gramm, Rolf Niedermeier
COMBINATORICA
2006
65views more  COMBINATORICA 2006»
13 years 11 months ago
A Linear Bound On The Diameter Of The Transportation Polytope
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m
Graham Brightwell, Jan van den Heuvel, Leen Stougi...
COMBINATORICA
2006
42views more  COMBINATORICA 2006»
13 years 11 months ago
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube
Christian Borgs, Jennifer T. Chayes, Remco van der...
COMBINATORICA
2006
55views more  COMBINATORICA 2006»
13 years 11 months ago
Density Conditions For Triangles In Multipartite Graphs
Adrian Bondy, Jian Shen, Stéphan Thomass&ea...
COMBINATORICA
2006
91views more  COMBINATORICA 2006»
13 years 11 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