Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CPC
2006
91views more  CPC 2006»
11 years 6 months ago
On the Independent Domination Number of Random Regular Graphs
William Duckworth, Nicholas C. Wormald
CPC
2006
116views more  CPC 2006»
11 years 6 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
CPC
2006
110views more  CPC 2006»
11 years 6 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
CPC
2006
74views more  CPC 2006»
11 years 6 months ago
Blocking Conductance and Mixing in Random Walks
Ravi Kannan, László Lovász, R...
CPC
2006
132views more  CPC 2006»
11 years 6 months ago
Duality in Infinite Graphs
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
Henning Bruhn, Reinhard Diestel
CPC
2006
97views more  CPC 2006»
11 years 6 months ago
Homomorphism-Homogeneous Relational Structures
We study relational structures (especially graphs and posets) which satisfy the analogue of homogeneity but for homomorphisms rather than isomorphisms. The picture is rather diffe...
Peter J. Cameron, Jaroslav Nesetril
CPC
2006
102views more  CPC 2006»
11 years 6 months ago
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
Abstract. The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results gives a new proof of a theorem of Frankl an...
W. T. Gowers
books