Journal: Combinatorica

Volume 25, Issue 6

633 -- 643József Balogh, Béla Bollobás. Unavoidable Traces Of Set Systems
645 -- 650Itai Benjamini, Gady Kozma. A Resistance Bound Via An Isoperimetric Inequality
651 -- 671Stavros Garoufalidis, Martin Loebl. Random Walks And The Colored Jones Function
673 -- 706Peter Keevash, Benny Sudakov. On A Hypergraph Turán Problem Of Frankl
707 -- 724Elchanan Mossel, Yuval Peres. New Coins From Old: Computing With Unknown Bias
725 -- 753Joseph Samuel Myers, Andrew Thomason. The Extremal Function For Noncomplete Minors

Volume 25, Issue 5

503 -- 518Richard P. Anstee, Attila Sali. Small Forbidden Configurations IV: The 3 Rowed Case
519 -- 535Irit Dinur, Oded Regev, Clifford D. Smyth. The Hardness of 3-Uniform Hypergraph Coloring
537 -- 559Ioana Dumitriu, Joel H. Spencer. The Liar Game Over an Arbitrary Channel
561 -- 574Peter Keevash, Benny Sudakov. The Turán Number Of The Fano Plane
575 -- 598Matthias Kriesell. Closed Separator Sets
599 -- 614Dhruv Mubayi, Jacques Verstraëte. Proof Of A Conjecture Of Erdös On Triangles In Set-Systems
615 -- 623Rom Pinchasi, Micha Sharir. On Graphs That Do Not Contain The Cube And Related Problems
625 -- 632Claude Tardif. The Fractional Chromatic Number Of The Categorical Product Of Graphs

Volume 25, Issue 4

379 -- 391Michael R. Capalbo. Explicit Bounded-Degree Unique-Neighbor Concentrators
393 -- 405Guojun Li, Ying Xu, Chuanping Chen, Zhenhong Liu. On Connected [::::g, f:::: +1]-Factors in Graphs
407 -- 424Nathan Linial, Eyal Rozenman. Random Lifts Of Graphs: Perfekt Matchings
425 -- 438Wolfgang Mader. Graphs With 3::::n::::-6 Edges Not Containing A Subdivision Of ::::K::::::5::
439 -- 450Sean McGuinness. Bonds Intersecting Cycles In A Graph
451 -- 463Sean McGuinness. Circuits Through Cocircuits In A Graph With Extensions To Matroids
465 -- 486Leonard J. Schulman, Vijay V. Vazirani. A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution
487 -- 498Benny Sudakov. A New Lower Bound For A Ramsey-Type Problem
499 -- 501Jeong Han Kim, Jirí Matousek, Van H. Vu. Discrepancy After Adding A Single Set

Volume 25, Issue 3

251 -- 269Joseph Cheriyan, Howard J. Karloff, Yuval Rabani. Approximating Directed Multicuts
271 -- 296Arjeh M. Cohen, Hans Cuypers, Ralf Gramlich. Local Recognition Of Non-Incident Point-Hyperplane Graphs
297 -- 305Alan M. Frieze, Nicholas C. Wormald. Random ::::k::::-Sat: A Tight Threshold For Moderately Growing ::::k::::
307 -- 326Ben Green. Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs
327 -- 353Ken-ichi Kawarabayashi, Bjarne Toft. Any 7-Chromatic Graphs Has ::::K::::::7:: Or ::::K::::::4, 4:: As A Minor
355 -- 366Radhika Ramamurthi, Douglas B. West. Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem
367 -- 377Hong Wang 0022. Maximal Total Length Of ::::k:::: Disjoint Cycles In Bipartite Graphs

Volume 25, Issue 2

125 -- 141Noga Alon, Vojtech Rödl. Sharp Bounds For Some Multicolor Ramsey Numbers
143 -- 186Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic. Recognizing Berge Graphs
187 -- 215James F. Geelen, Satoru Iwata. Matroid Matching Via Mixed Skew-Symmetric Matrices
217 -- 249Joe Kilian, Charles Rackoff, Erez Petrank. Lower Bounds For Concurrent Zero Knowledge*

Volume 25, Issue 1

1 -- 18Eli Berger. KKM-A Topological Approach For Trees
19 -- 38Christian Bey. Polynomial Lym Inequalities
39 -- 47Tom Bohman, Ron Holzman. Linear Versus Hereditary Discrepancy
49 -- 64Daniela Kühn, Deryk Osthus. Complete Minors In K::s, s::-Free Graphs
65 -- 76Bojan Mohar. Hajós Theorem For Colorings Of Edge-Weighted Graphs
77 -- 84Gábor N. Sárközy, Stanley M. Selkow. An Extension Of The Ruzsa-Szemerédi Theorem
85 -- 103Carsten Thomassen. Classification Of Locally 2-Connected Compact Metric Spaces
105 -- 110Rudolf Ahlswede, Levon H. Khachatrian. Katona s Intersection Theorem: Four Proofs
111 -- 116Reinhard Diestel, Christof Rempel. Dense Minors In Graphs Of Large Girth
117 -- 123Bruce A. Reed, Benny Sudakov. List Colouring When The Chromatic Number Is Close To the Order Of The Graph