COMBINATORICA 2006 | Sciweavers

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

claim paper

Read More »

14

click to vote

COMBINATORICA
2006

65views more COMBINATORICA 2006»

A Linear Bound On The Diameter Of The Transportation Polytope

13 years 4 months ago

Download www.win.tue.nl

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...

claim paper

Read More »

4

click to vote

COMBINATORICA
2006

42views more COMBINATORICA 2006»

Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube

13 years 4 months ago

Download www.win.tue.nl

Christian Borgs, Jennifer T. Chayes, Remco van der...

claim paper

Read More »

5

click to vote

COMBINATORICA
2006

55views more COMBINATORICA 2006»

Density Conditions For Triangles In Multipartite Graphs

13 years 4 months ago

Download www.lirmm.fr

Adrian Bondy, Jian Shen, Stéphan Thomass&ea...

claim paper

Read More »

10

click to vote

COMBINATORICA
2006

91views more COMBINATORICA 2006»

The Number Of Orientations Having No Fixed Tournament

13 years 4 months ago

Download www.tau.ac.il

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers