Journal: Combinatorica

Volume 27, Issue 6

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

Volume 27, Issue 5

519 -- 550Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian. Complete partitions of graphs
551 -- 585Robert Krauthgamer, James R. Lee. The intrinsic dimensionality of graphs
587 -- 628Joel H. Spencer, Nicholas C. Wormald. Birth control for giants

Volume 27, Issue 4

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

Volume 27, Issue 3

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

Volume 27, Issue 2

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

Volume 27, Issue 1

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