Combinatorica, Volume 27

Volume 27, Number 1, February 2007

Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason:
Vertex-Colouring Edge-Weightings. 1-12
Noga Alon, Eyal Lubetzky:
Codes And Xor Graph Products. 13-33
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
Three-Color Ramsey Numbers For Paths. 35-69
Lap Chi Lau:
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. 71-90
Mikkel Thorup:
Fully-Dynamic Min-Cut. 91-127
Eric Jaligot:
On Stabilizers Of Some Moieties Of The Random Tournament. 129-133

Etienne Birmelé, John Adrian Bondy, Bruce A. Reed:
The Erdös-Pósa Property For Long Circuits. 135-145
Péter L. Erdös, Lajos Soukup:
How To Split Antichains In Infinite Posets. 147-161
Dina Ghinelli, Dieter Jungnickel:
A Non-Existence Result For Finite Projective Planes In Lenz-Barlotti Class I.4. 163-166
Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Total Colorings Of Degenerate Graphs. 167-182
Colin McDiarmid:
On The Span Of A Random Channel Assignment Problem. 183-203
Jiri Sgall, Gerhard J. Woeginger:
An Approximation Scheme For Cake Division With A Linear Number Of Cuts. 205-211
Amnon Ta-Shma, Christopher Umans, David Zuckerman:
Lossless Condensers, Unbalanced Expanders, And Extractors. 213-240
Carsten Thomassen:
On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. 241-243
Hong-Jian Lai, Rui Xu, Cun-Quan Zhang:
On Circular Flows Of Graphs. 245-246
Gyula Pap:
Packing Non-Returning A-Paths. 247-251

Ron Aharoni, Eli Berger, Ran Ziv:
Independent systems of representatives in weighted graphs. 253-267
Henning Bruhn, Maya Stein:
On end degrees and infinite cycles in locally finite graphs. 269-291
Eldar Fischer, Ilan Newman:
Testing of matrix-poset properties. 293-327
Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz:
K ₄-free subgraphs of random graphs revisited. 329-365
Serkan Hosten, Bernd Sturmfels:
Computing the integer programming gap. 367-382
Gyula Pap, László Szegö:
Matchings of cycles and paths in directed graphs. 383-398
Zsuzsanna Szaniszló, Zsolt Tuza:
Lower bound on the profile of degree pairs in cross-intersecting set systems. 399-405

Richard N. Ball, Ales Pultr, Petr Vojtechovský:
Colored graphs without colorful cycles. 407-427
Ken-ichi Kawarabayashi, Zi-Xia Song:
Some remarks on the odd hadwiger's conjecture. 429-438
Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman:
Complexity measures of sign matrices. 439-463
Eran Nevo:
On embeddability and stresses of graphs. 465-472
Stéphan Thomassé, Anders Yeo:
Total domination of graphs and small transversals of hypergraphs. 473-487
Shawn Austin Walker:
Multicover inequalities on colored complexes. 489-501
Gábor Elek:
Note on limits of finite graphs. 503-507
Benny Sudakov:
Note making a K ₄-free graph bipartite. 509-518

Noga Alon, Michael Krivelevich, Benny Sudakov:
Embedding nearly-spanning bounded degree trees. 629-644
Omer Angel, Itai Benjamini:
A phase transition for the metric distortion of percolation on the hypercube. 645-658
Stéphane Bessy, Stéphan Thomassé:
Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. 659-667
Péter Csorba:
Homotopy types of box complexes. 669-682
Agelos Georgakopoulos:
Connected but not path-connected subspaces of infinite graphs. 683-698
Anna de Mier:
k -noncrossing and k -nonnesting graphs and fillings of ferrers diagrams. 699-720
Van H. Vu:
Spectral norm of random matrices. 721-736
Noga Alon, Eyal Lubetzky:
Privileged users in zero-error transmission over a noisy channel. 737-743
Sanming Zhou:
Almost covers of 2-arc transitive graphs. 745-746

Last update Wed Feb 15 05:26:44 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page