COMBINATORICA

Honorary founder: Paul Erdős

CONTENTS OF PUBLISHED ISSUES

Volume 1, Issue 1, 1981

Miklós Ajtai, János Komlós, Endre Szemerédi
The longest path in a random graph
Pages 1-12  |  DOI:10.1007/BF02579172

F. R. K. Chung, P. Erdős, R. L. Graham
Minimal decompositions of graphs into mutually isomorphic subgraphs
Pages 13-24  |  DOI:10.1007/BF02579173

P. Erdős
On the combinatorial problems which I would most like to see solved
Pages 25-42  |  DOI:10.1007/BF02579174

Heinz Gröflin, Alan J. Hoffman
On matroid intersections
Pages 43-47  |  DOI:10.1007/BF02579175

Daniel J. Kleitman, Kenneth J. Winston
Forests and score vectors
Pages 49-54  |  DOI:10.1007/BF02579176

Shuo-Yen Robert Li, Wen-Ch’ing Winnie Li
Independence numbers of graphs and generators of ideals
Pages 55-61  |  DOI:10.1007/BF02579177

J. H. van Lint, A. Schrijver
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
Pages 63-73  |  DOI:10.1007/BF02579178

P. D. Seymour
Recognizing graphic matroids
Pages 75-78  |  DOI:10.1007/BF02579179

W. T. Tutte
Graph factors
Pages 79-97  |  DOI:10.1007/BF02579180

Volume 1, Issue 2, 1981

Eiichi Bannai, Etsuko Bannai
An upper bound for the cardinality of ans-distance subset in real euclidean space
Pages 99-102  |  DOI:10.1007/BF02579266

József Beck
Van der waerden and ramsey type games
Pages 103-116  |  DOI:10.1007/BF02579267

J. A. Bondy, L. Lovász
Cycles through specified vertices of a graph
Pages 117-140  |  DOI:10.1007/BF02579268

Paul Erdős, Siemion Fajtlowicz
On the conjecture of hajós
Pages 141-143  |  DOI:10.1007/BF02579269

András Frank
How to make a digraph strongly connected
Pages 145-153  |  DOI:10.1007/BF02579270

Zoltán Füredi
Maximum degree and fractional matchings in uniform hypergraphs
Pages 155-162  |  DOI:10.1007/BF02579271

C. D. Godsil
Equiarboreal graphs
Pages 163-167  |  DOI:10.1007/BF02579272

M. Grötschel, L. Lovász, A. Schrijver
The ellipsoid method and its consequences in combinatorial optimization
Pages 169-197  |  DOI:10.1007/BF02579273

Jaroslav Nešetřil, Vojtěch Rödl
Simple proof of the existence of restricted ramsey graphs by means of a partite construction
Pages 199-202  |  DOI:10.1007/BF02579274

Joel Spencer
Suresums
Pages 203-208  |  DOI:10.1007/BF02579275

Volume 1, Issue 3, 1981

József Beck
Balancing families of integer sequences
Pages 209-216  |  DOI:10.1007/BF02579326

C. Berge, C. C. Chen, V. Chvátal, C. S. Seow
Combinatorial properties of polyominoes
Pages 217-224  |  DOI:10.1007/BF02579327

M. Deza, P. Frankl
Every large set of equidistant (0, +1, −1)-vectors forms a sunflower
Pages 225-231  |  DOI:10.1007/BF02579328

Z. Füredi, J. Komlós
The eigenvalues of random symmetric matrices
Pages 233-241  |  DOI:10.1007/BF02579329

C. D. Godsil
On the full automorphism group of a graph
Pages 243-256  |  DOI:10.1007/BF02579330

C. D. Godsil
Hermite polynomials and a duality relation for matchings polynomials
Pages 257-262  |  DOI:10.1007/BF02579331

Ervin Győri
Partition conditions and vertex-connectivity of graphs
Pages 263-273  |  DOI:10.1007/BF02579332

Peter L. Hammer, Bruno Simeone
The splittance of a graph
Pages 275-284  |  DOI:10.1007/BF02579333

H. A. Jung
A note on fragments of infinite graphs
Pages 285-288  |  DOI:10.1007/BF02579334

P. J. Schellenberg, D. R. Stinson, S. A. Vanstone, J. W. Yates
The existence of howell designs of siden+1 and order 2n
Pages 289-301  |  DOI:10.1007/BF02579335

Joel Spencer
Extremal problems, partition theorems, symmetric hypergraphs
Pages 303-307  |  DOI:10.1007/BF02579336

Richard Weiss
The nonexistence of 8-transitive graphs
Pages 309-311  |  DOI:10.1007/BF02579337

Volume 1, Issue 4, 1981

M. Ajtai, P. Erdős, J. Komlós, E. Szemerédi
On Turán’s theorem for sparse graphs
Pages 313-317  |  DOI:10.1007/BF02579451

József Beck
Roth’s estimate of the discrepancy of integer sequences is nearly sharp
Pages 319-325  |  DOI:10.1007/BF02579452

József Beck
Balanced two-colorings of finite sets in the square I
Pages 327-335  |  DOI:10.1007/BF02579453

J. C. Bermond, A. Germa, M. C. Heydemann, D. Sotteau
Longest paths in digraphs
Pages 337-341  |  DOI:10.1007/BF02579454

P. J. Cameron
Normal subgroups of infinite multiply transitive permutation groups
Pages 343-347  |  DOI:10.1007/BF02579455

W. Fernandez de la Vega, G. S. Lueker
Bin packing can be solved within 1 + ε in linear time
Pages 349-355  |  DOI:10.1007/BF02579456

P. Frankl, R. M. Wilson
Intersection theorems with geometric consequences
Pages 357-368  |  DOI:10.1007/BF02579457

C. D. Godsil
Matching behaviour is asymptotically normal
Pages 369-376  |  DOI:10.1007/BF02579458

Ervin Győri
Ann-dimensional search problem with restricted questions
Pages 377-380  |  DOI:10.1007/BF02579459

D. J. Kleitman, J. Shearer, D. Sturtevant
Intersections ofk-element sets
Pages 381-384  |  DOI:10.1007/BF02579460

W. Mader
On a property ofn-edge-connected digraphs
Pages 385-386  |  DOI:10.1007/BF02579461

P. D. Seymour
On minors of non-binary matroids
Pages 387-394  |  DOI:10.1007/BF02579462

Volume 2, Issue 1, 1982

M. Ajtai, J. Komlós, E. Szemerédi
Largest random component of ak-cube
Pages 1-7  |  DOI:10.1007/BF02579276

Peter J. Cameron
There are only finitely many finite distance-transitive graphs of given valency greater than two
Pages 9-13  |  DOI:10.1007/BF02579277

M. J. Dunwoody
Cutting up graphs
Pages 15-23  |  DOI:10.1007/BF02579278

H. -D. O. F. Gronau
On sperner families in which nok sets have an empty intersection III
Pages 25-36  |  DOI:10.1007/BF02579279

A. J. W. Hilton
Canonical edge-colourings of locally finite graphs
Pages 37-51  |  DOI:10.1007/BF02579280

D. A. Holton, B. D. McKay, M. D. Plummer, C. Thomassen
A nine point theorem for 3-connected graphs
Pages 53-62  |  DOI:10.1007/BF02579281

H. D. Macpherson
Infinite distance transitive graphs of finite valency
Pages 63-69  |  DOI:10.1007/BF02579282

G. A. Margulis
Explicit constructions of graphs without short cycles and low density codes
Pages 71-78  |  DOI:10.1007/BF02579283

R. Nowakowski, I. Rival
On a class of isometric subgraphs of a graph
Pages 79-90  |  DOI:10.1007/BF02579284

P. D. Seymour
Packing nearly-disjoint sets
Pages 91-97  |  DOI:10.1007/BF02579285

W. D. Wallis
Asymptotic values of clique partition numbers
Pages 99-101  |  DOI:10.1007/BF02579286

Volume 2, Issue 2, 1982

R. D. Baker
Symmetric designs with bruck subdesigns
Pages 103-109  |  DOI:10.1007/BF02579308

József Beck
Irregularities of two-colourings of theN×N square lattice
Pages 111-123  |  DOI:10.1007/BF02579309

Béla Bollobás, W. Fernandez de la Vega
The diameter of random regular graphs
Pages 125-134  |  DOI:10.1007/BF02579310

Raul Cordovil
On reid’s 3-simplicial matroid theorem
Pages 135-141  |  DOI:10.1007/BF02579311

Yahya Ould Hamidoune
A note on the girth of digraphs
Pages 143-147  |  DOI:10.1007/BF02579312

D. A. Holton, C. H. C. Little
Regular odd rings and non-planar graphs
Pages 149-152  |  DOI:10.1007/BF02579313

Ferenc Juhász
The asymptotic behaviour of lovász’ ϑ function for random graphs
Pages 153-155  |  DOI:10.1007/BF02579314

R. Kemp
On the average oscillation of a stack
Pages 157-176  |  DOI:10.1007/BF02579315

Peter Kirschenhofer, Helmut Prodinger
On the average hyperoscillations of planted plane trees
Pages 177-186  |  DOI:10.1007/BF02579316

A. V. Kostochka
A class of constructions for turán’s (3, 4)-problem
Pages 187-192  |  DOI:10.1007/BF02579317

Vladimír Müller, Vojtěch Rödl
Monotone paths in ordered graphs
Pages 193-201  |  DOI:10.1007/BF02579318

Volume 2, Issue 3, 1982

László Lovász
Tibor Gallai
Pages 203-205  |  DOI:10.1007/BF02579227

P. Erdős
Personal reminiscences and remarks on the mathematical work of Tibor Gallai
Pages 207-212  |  DOI:10.1007/BF02579228

Claude Berge
Diperfect graphs
Pages 213-222  |  DOI:10.1007/BF02579229

Béla Bollobás
Long paths in sparse random graphs
Pages 223-228  |  DOI:10.1007/BF02579230

François Bry, Michel Las Vergnas
The edmonds—Gallai decomposition for matchings in locally finite graphs
Pages 229-235  |  DOI:10.1007/BF02579231

Ludwig Danzer, Branko Grünbaum
Intersection properties of boxes in R d
Pages 237-246  |  DOI:10.1007/BF02579232

J. Edmonds, W. R. Pulleyblank, L. Lovász
Brick decompositions and the matching rank of graphs
Pages 247-274  |  DOI:10.1007/BF02579233

P. Erdős, M. Simonovits
Compactness results in extremal graph theory
Pages 275-288  |  DOI:10.1007/BF02579234

P. Erdős, Vera T. Sós
On Ramsey—Turán type theorems for hypergraphs
Pages 289-295  |  DOI:10.1007/BF02579235

R. Halin
Some remarks on interval graphs
Pages 297-304  |  DOI:10.1007/BF02579236

J. Lehel
Covers in hypergraphs
Pages 305-309  |  DOI:10.1007/BF02579237

Richard Rado
Atoms of families of sets
Pages 311-314  |  DOI:10.1007/BF02579238

Michael Stiebitz
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
Pages 315-323  |  DOI:10.1007/BF02579239

W. T. Tutte
The method of alternating paths
Pages 325-332  |  DOI:10.1007/BF02579240

Volume 2, Issue 4, 1982

A. E. Brouwer
The uniqueness of the near hexagon on 729 points
Pages 333-340  |  DOI:10.1007/BF02579429

M. Deza, P. Frankl
On the vector space of 0-configurations
Pages 341-345  |  DOI:10.1007/BF02579430

T. I. Fenner, A. M. Frieze
On the connectivity of randomm-orientable graphs and digraphs
Pages 347-359  |  DOI:10.1007/BF02579431

A Frank
Disjoint paths in a rectilinear grid
Pages 361-371  |  DOI:10.1007/BF02579432

H. A. Jung, A. K. Kelmans, R. L. Hemminger
On 3-skein isomorphisms of graphs
Pages 373-376  |  DOI:10.1007/BF02579433

Vojtěch Rödl
Nearly bipartite graphs with large chromatic number
Pages 377-383  |  DOI:10.1007/BF02579434

L. A. Wolsey
An analysis of the greedy algorithm for the submodular set covering problem
Pages 385-393  |  DOI:10.1007/BF02579435

L. S. Zaremba, S. Perz
On a geometric property of perfect graphs
Pages 395-397  |  DOI:10.1007/BF02579436

Volume 3, Issue 1, 1983

M. Ajtai, J. Komlós, E. Szemerédi
Sorting inc logn parallel steps
Pages 1-19  |  DOI:10.1007/BF02579338

H. Bauer, B. Ganter, F. Hergert
Algebraic techniques for nonlinear codes
Pages 21-33  |  DOI:10.1007/BF02579339

G. Cornuéjols, W. R. Pulleyblank
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
Pages 35-52  |  DOI:10.1007/BF02579340

William H. Cunningham
Decomposition of submodular functions
Pages 53-68  |  DOI:10.1007/BF02579341

P. Erdős, A. Hajnal, Vera T. Sós, E. Szemerédi
More results on Ramsey—Turán type problems
Pages 69-81  |  DOI:10.1007/BF02579342

Ralph J. Faudree, Miklós Simonovits
On a class of degenerate extremal graph problems
Pages 83-93  |  DOI:10.1007/BF02579343

Péter Hajnal
Partition of graphs with condition on the connectivity and minimum degree
Pages 95-99  |  DOI:10.1007/BF02579344

N. Linial, M. Saks, Vera T. Sós
Largest digraphs contained in alln-tournaments
Pages 101-104  |  DOI:10.1007/BF02579345

L. Lovász
Ear-decompositions of matching-covered graphs
Pages 105-117  |  DOI:10.1007/BF02579346

Svatopluk Poljak, Miroslav Sůra
On periodical behaviour in societies with symmetric influences
Pages 119-121  |  DOI:10.1007/BF02579347

Eli Shamir
How many random edges make a graph hamiltonian?
Pages 123-131  |  DOI:10.1007/BF02579348

C. Thomassen
Cycles in graphs of uncountable chromatic number
Pages 133-134  |  DOI:10.1007/BF02579349

Peter M. Winkler
Proof of the squashed cube conjecture
Pages 135-139  |  DOI:10.1007/BF02579350

Volume 3, Issue 2, 1983

Richard Anstee
Hypergraphs with no special cycles
Pages 141-146  |  DOI:10.1007/BF02579287

Eiichi Bannai, Etsuko Bannai, Dennis Stanton
An upper bound for the cardinality of ans-distance subset in real euclidean space, II
Pages 147-152  |  DOI:10.1007/BF02579288

N. L. Biggs, M. J. Hoare
The sextet construction for cubic graphs
Pages 153-165  |  DOI:10.1007/BF02579289

F. R. K. Chung, P. Erdős
On unavoidable graphs
Pages 167-176  |  DOI:10.1007/BF02579290

J. Demetrovics, Gy. Gyepesi
A note on minimal matrix representation of closure operations
Pages 177-179  |  DOI:10.1007/BF02579291

Paul Erdős, Miklós Simonovits
Supersaturated graphs and hypergraphs
Pages 181-192  |  DOI:10.1007/BF02579292

Peter Frankl
An extremal set theoretical characterization of some steiner systems
Pages 193-199  |  DOI:10.1007/BF02579293

Mikio Kano
Cycle games and cycle cut games
Pages 201-206  |  DOI:10.1007/BF02579294

M. V. Lomonosov
On the planar integer two-flow problem
Pages 207-218  |  DOI:10.1007/BF02579295

A. Neumaier, J. J. Seidel
Discrete hyperbolic geometry
Pages 219-237  |  DOI:10.1007/BF02579296

Joel Spencer
What’s not inside a Cayley graph
Pages 239-241  |  DOI:10.1007/BF02579297

Volume 3, Issue 3-4, 1983

Richard Rado
Paul Erdős’
Pages 243-244  |  DOI:10.1007/BF02579181

E. G. Straus
Paul Erdős at 70
Pages 245-246  |  DOI:10.1007/BF02579182


List of publications of Paul Erdős
Pages 247-280  |  DOI:10.1007/BF02579183

József Beck
On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
Pages 281-297  |  DOI:10.1007/BF02579184

József Beck, Joel Spencer
Balancing matrices with line shifts
Pages 299-304  |  DOI:10.1007/BF02579185

Ralf Bicker, Bernd Voigt
Density theorems for finitistic trees
Pages 305-313  |  DOI:10.1007/BF02579186

F. R. K. Chung, R. L. Graham
Edge-colored complete graphs with precisely colored subgraphs
Pages 315-324  |  DOI:10.1007/BF02579187

V. Chvátal
Mastermind
Pages 325-329  |  DOI:10.1007/BF02579188

M. Deza, P. Frankl, N. M. Singhi
On functions of strengtht
Pages 331-339  |  DOI:10.1007/BF02579189

Peter Frankl, Zoltán Füredi
A new generalization of the Erdős-Ko-Rado theorem
Pages 341-349  |  DOI:10.1007/BF02579190

A. Gyárfás, J. Lehel
Hypergraph families with bounded edge cover or transversal number
Pages 351-358  |  DOI:10.1007/BF02579191

Bernhard Korte, László Lovász
Structural properties of greedoids
Pages 359-374  |  DOI:10.1007/BF02579192

A. Schrijver
Bounds on the number of Eulerian orientations
Pages 375-380  |  DOI:10.1007/BF02579193

E. Szemerédi, W. T. Trotter Jr.
Extremal problems in discrete geometry
Pages 381-392  |  DOI:10.1007/BF02579194

Carsten Thomassen
Disjoint cycles in digraphs
Pages 393-396  |  DOI:10.1007/BF02579195

Volume 4, Issue 1, 1984

Ron Aharoni
On an obstruction for perfect matchings
Pages 1-6  |  DOI:10.1007/BF02579151

Béla Bollobás, Victor Klee
Diameters of random bipartite graphs
Pages 7-19  |  DOI:10.1007/BF02579152

Péter L. Erdős, Peter Frankl, Gyula O. H. Katona
Intersecting sperner families and their convex hulls
Pages 21-34  |  DOI:10.1007/BF02579153

Siemion Fajtlowicz
Independence, clique size and maximum degree
Pages 35-38  |  DOI:10.1007/BF02579154

Peter Frankl, János Pach
On disjointly representable sets
Pages 39-45  |  DOI:10.1007/BF02579155

András Hajnal, Péter Komjáth
What must and what need not be contained in a graph of uncountable chromatic number?
Pages 47-52  |  DOI:10.1007/BF02579156

Wilfried Imrich
Explicit construction of regular graphs without small cycles
Pages 53-59  |  DOI:10.1007/BF02579157

A. Meir, J. W. Moon
On random mapping patterns
Pages 61-70  |  DOI:10.1007/BF02579158

Jaroslav Nešetřil, Vojtěch Rödl
Sparse ramsey graphs
Pages 71-78  |  DOI:10.1007/BF02579159

Kevin T. Phelps, Vojtěch Rödl
On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems
Pages 79-88  |  DOI:10.1007/BF02579160

Horst Sachs
Perfect matchings in hexagonal systems
Pages 89-99  |  DOI:10.1007/BF02579161

Miklós Simonovits, Vera T. Sós
On restricted colourings ofK n
Pages 101-110  |  DOI:10.1007/BF02579162

Zsolt Tuza
Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices
Pages 111-116  |  DOI:10.1007/BF02579163

D. B. West, W. T. Trotter Jr., G. W. Peck, P. Shor
Regressions and monotone chains: A ramsey-type extremal problem for partial orders
Pages 117-119  |  DOI:10.1007/BF02579164

Volume 4, Issue 2-3, 1984

J. E. Dawson, D. B. Skillicorn, Jennifer Seberry
The directed packing numbersDD(t, v, v), t≧4
Pages 121-130  |  DOI:10.1007/BF02579211

G. Elekes
n points in the plane can determinen 3/2 unit circles
Page 131  |  DOI:10.1007/BF02579212

Konrad Engel
An Erdös-Ko-Rado theorem for the subcubes of a cube
Pages 133-140  |  DOI:10.1007/BF02579213

Peter Frankl
Families of finite sets with three intersections
Pages 141-148  |  DOI:10.1007/BF02579214

Peter Frankl, Vojtěch Rödl
Hypergraphs do not jump
Pages 149-159  |  DOI:10.1007/BF02579215

Zoltán Füredi
Hypergraphs in which all disjoint pairs have distinct unions
Pages 161-168  |  DOI:10.1007/BF02579216

Frank Harary, Robert W. Robinson
Isomorphic factorizations VIII: Bisectable trees
Pages 169-179  |  DOI:10.1007/BF02579217

Jeffry Kahn, Michael Saks
A polyomino with no stochastic function
Pages 181-182  |  DOI:10.1007/BF02579218

H. A. Kierstead, E. Szemerédi, W. T. Trotter Jr.
On coloring graphs with locally small chromatic number
Pages 183-185  |  DOI:10.1007/BF02579219

James G. Oxley
On the intersections of circuits and cocircuits in matroids
Pages 187-195  |  DOI:10.1007/BF02579220

K. R. Parthasarathy, N. Srinivasan
Geodetic blocks of diameter three
Pages 197-206  |  DOI:10.1007/BF02579221

S. C. Shee, H. H. Teh
H-extension of graphs
Pages 207-211  |  DOI:10.1007/BF02579222

L. A. Székely
Measurable chromatic number of geometric graphs and sets without some distances in euclidean space
Pages 213-218  |  DOI:10.1007/BF02579223

B. Voigt
Canonization theorems for finite affine and linear spaces
Pages 219-239  |  DOI:10.1007/BF02579224

Alfred Weiss
Girths of bipartite sextet graphs
Pages 241-245  |  DOI:10.1007/BF02579225

Richard M. Wilson
The exact bound in the Erdös-Ko-Rado theorem
Pages 247-257  |  DOI:10.1007/BF02579226

Volume 4, Issue 4, 1984

M. Ajtai, J. Komlós, G. Tusnády
On optimal matchings
Pages 259-264  |  DOI:10.1007/BF02579135

M. N. Ellingham, D. A. Holton, C. H. C. Little
Cycles through ten vertices in 3-connected cubic graphs
Pages 265-273  |  DOI:10.1007/BF02579136

Hikoe Enomoto, Akira Saito
Disjoint shortest paths in graphs
Pages 275-279  |  DOI:10.1007/BF02579137

Heinz Gröflin
Path-closed sets
Pages 281-290  |  DOI:10.1007/BF02579138

M. Grötschel, L. Lovász, A. Schrijver
Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization”
Pages 291-295  |  DOI:10.1007/BF02579139

Jeff Kahn, Michael Saks, Dean Sturtevant
A topological approach to evasiveness
Pages 297-306  |  DOI:10.1007/BF02579140

A. V. Kostochka
Lower bound of the hadwiger number of graphs by their average degree
Pages 307-316  |  DOI:10.1007/BF02579141

Igor Kříž
A class of dimension-skipping graphs
Pages 317-319  |  DOI:10.1007/BF02579142

J. H. van Lint
On equidistant binary codes of lengthn=4k+1 with distanced=2k
Pages 321-323  |  DOI:10.1007/BF02579143

B. D. McKay, N. C. Wormald
Automorphisms of random graphs with specified vertices
Pages 325-338  |  DOI:10.1007/BF02579144

Michael v. Rimscha
The reconstruction problem for certain infinite graphs
Pages 339-343  |  DOI:10.1007/BF02579145

Vojtěch Rödl
On combinatorial properties of spheres in euclidean spaces
Pages 345-349  |  DOI:10.1007/BF02579146

Norbert Seifter
On automorphisms of infinite graphs with forbidden subgraphs
Pages 351-356  |  DOI:10.1007/BF02579147

D. R. Stinson, G. H. J. van Rees
The equivalence of certain equidistant binary codes and symmetric bibds
Pages 357-362  |  DOI:10.1007/BF02579148

L. A. Székely
On the number of homogeneous subgraphs of a graph
Pages 363-372  |  DOI:10.1007/BF02579149

N. Karmarkar
A new polynomial-time algorithm for linear programming
Pages 373-395  |  DOI:10.1007/BF02579150

Volume 5, Issue 1, 1985

J. E. Dawson
Decomposition of binary matroids
Pages 1-9  |  DOI:10.1007/BF02579437

Péter L. Erdős, G. O. H. Katona, P. Frankl
Extremal hypergraph problems and convex hulls
Pages 11-26  |  DOI:10.1007/BF02579438

Z. Füredi
Set systems with three intersections
Pages 27-31  |  DOI:10.1007/BF02579439

C. D. Godsil
Inverses of trees
Pages 33-39  |  DOI:10.1007/BF02579440

A. Gyárfás, H. J. Prömel, B. Voigt, E. Szemerédi
On the sum of the reciprocals of cycle lengths in sparse graphs
Pages 41-52  |  DOI:10.1007/BF02579441

E. Győri
Covering simply connected regions by rectangles
Pages 53-55  |  DOI:10.1007/BF02579442

J. Komlós
Linear verification for spanning trees
Pages 57-65  |  DOI:10.1007/BF02579443

L. Pyber
An erdős—Gallai conjecture
Pages 67-79  |  DOI:10.1007/BF02579444

Jeanette Schmidt-Pruzan, Eli Shamir
Component structure in the evolution of random hypergraphs
Pages 81-94  |  DOI:10.1007/BF02579445

Volume 5, Issue 2, 1985

Knut Deimer
A new upper bound for the length of snakes
  |  DOI:10.1007/BF02579373

Jürgen Bierbrauer, Albrecht Brandis
On generalized ramsey numbers for trees
Pages 95-107  |  DOI:10.1007/BF02579372

Mohamed El-Zahar, Norbert Sauer
The chromatic number of the product of two 4-chromatic graphs is 4
Pages 121-126  |  DOI:10.1007/BF02579374

H. de Fraysseix, P. Rosenstiehl
A characterization of planar graphs by trémaux orders
Pages 127-135  |  DOI:10.1007/BF02579375

A. Hajnal
The chromatic number of the product of two ℵ1-chromatic graphs can be countable
Pages 137-139  |  DOI:10.1007/BF02579376

P. L. Hammer, N. V. R. Mahadev, D. de Werra
The struction of a graph: Application toCN-free graphs
Pages 141-147  |  DOI:10.1007/BF02579377

Stephen C. Locke
A generalization of dirac’s theorem
Pages 149-159  |  DOI:10.1007/BF02579378

W. Mader
Degree and local connectivity in digraphs
Pages 161-165  |  DOI:10.1007/BF02579379

B. L. Rotschild, E. G. Straus
On triangulations of the convex hull ofn points
Pages 167-179  |  DOI:10.1007/BF02579380

Volume 5, Issue 3, 1985

Ron Aharoni
Fractional matchings and covers in infinite hypergraphs
Pages 181-184  |  DOI:10.1007/BF02579360

William H. Cunningham
On submodular function minimization
Pages 185-192  |  DOI:10.1007/BF02579361

A. Gyárfás, J. Lehel, ZS. Tuza
How many atoms can be defined by boxes?
Pages 193-204  |  DOI:10.1007/BF02579362

D. Hajela, P. Seymour
Counting points in hypercubes and convolution measure algebras
Pages 205-214  |  DOI:10.1007/BF02579363

Melvin Hausner
Inclusion-exclusion inequalities
Pages 215-225  |  DOI:10.1007/BF02579364

G. Koester
Note to a problem of T. Gallai and G. A. Dirac
Pages 227-228  |  DOI:10.1007/BF02579365

A. V. Kostochka
Maximum set of edges no two covered by a clique
Pages 229-235  |  DOI:10.1007/BF02579366

B. Lindström
A desarguesian theorem for algebraic combinatorial geometries
Pages 237-239  |  DOI:10.1007/BF02579367

J. B. Shearer
On a problem of spencer
Pages 241-245  |  DOI:10.1007/BF02579368

Éva Tardos
A strongly polynomial minimum cost circulation algorithm
Pages 247-255  |  DOI:10.1007/BF02579369

A. Vince, M. Wachs
A shellable poset that is not lexicographically shellable
Pages 257-260  |  DOI:10.1007/BF02579370

H. -J. Voss
Independent sets ink-chromatic graphs
Pages 261-269  |  DOI:10.1007/BF02579371

Volume 5, Issue 4, 1985

R. W. Decker, H. H. Glover, J. P. Huneke
Computing the genus of the 2-amalgamations of graphs
Pages 271-282  |  DOI:10.1007/BF02579241

Reinhard Diestel, Rudolf Halin, Walter Vogler
Some remarks on universal graphs
Pages 283-293  |  DOI:10.1007/BF02579242

M. El-Zahar, P. Erdős
On the existence of two non-neighboring subgraphs in a graph
Pages 295-300  |  DOI:10.1007/BF02579243

Konrad Engel, Nikolaj Nikolajevič Kuzjurin
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets
Pages 301-309  |  DOI:10.1007/BF02579244

P. Erdős, R. J. Faudree, C. C. Rousseau, R. H. Schelp
Multipartite graph—Sparse graph Ramsey numbers
Pages 311-318  |  DOI:10.1007/BF02579245

Jeff Kahn
A problem of P. Seymour on nonbinary matroids
Pages 319-323  |  DOI:10.1007/BF02579246

A. V. Karzanov
Families of cuts with the MFMC-property
Pages 325-335  |  DOI:10.1007/BF02579247

H. J. Landau, B. F. Logan, L. A. Shepp
An inequality conjectured by Hajela and Seymour arising in combinatorial geometry
Pages 337-342  |  DOI:10.1007/BF02579248

James G. Oxley
Proof of a conjecture of Kahn for non-binary matroids
Pages 343-345  |  DOI:10.1007/BF02579249

L. Pyber
Regular subgraphs of dense graphs
Pages 347-349  |  DOI:10.1007/BF02579250

S. S. Shrikhande, N. M. Singhi
On a problem of Erdős and Larson
Pages 351-358  |  DOI:10.1007/BF02579251

K. Steffens
Maximal tight sets and the edmonds—Gallai decomposition for matchings
Pages 359-365  |  DOI:10.1007/BF02579252

R. E. Tarjan
Sequential access in splay trees takes linear time
Pages 367-378  |  DOI:10.1007/BF02579253

Volume 6, Issue 1, 1986

L. Babai
On Lovász’ lattice reduction and the nearest lattice point problem
Pages 1-13  |  DOI:10.1007/BF02579403

E. A. Bender, L. B. Richmond, R. W. Robinson, N. C. Wormald
The asymptotic number of acyclic digraphs. I
Pages 15-22  |  DOI:10.1007/BF02579404

Mostafa Blidia
A parity digraph has a kernel
Pages 23-27  |  DOI:10.1007/BF02579405

U. Faigle, B. Sands
A size-width inequality for distributive lattices
Pages 29-33  |  DOI:10.1007/BF02579406

R. M. Karp, E. Upfal, A. Wigderson
Constructing a perfect matching is in random NC
Pages 35-48  |  DOI:10.1007/BF02579407

N. Linial
Legal coloring of graphs
Pages 49-54  |  DOI:10.1007/BF02579408

J. Spencer
Balancing vectors in the max norm
Pages 55-65  |  DOI:10.1007/BF02579409

M. Szegedy
The solution of graham’s greatest common divisor problem
Pages 67-71  |  DOI:10.1007/BF02579410

I. Tomescu
On the number of paths and cycles for almost all graphs and digraphs
Pages 73-79  |  DOI:10.1007/BF02579411

Volume 6, Issue 2, 1986

László Lovász, László Babai
Editors’ foreword
Page i  |  DOI:10.1007/BF02579165

Noga Alon
Eigenvalues and expanders
Pages 83-96  |  DOI:10.1007/BF02579166

Manuel Blum
Independent unbiased coin flips from a correlated biased source—A finite state markov chain
Pages 97-108  |  DOI:10.1007/BF02579167

Harold N. Gabow, Zvi Galil, Thomas Spencer, Robert E. Tarjan
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Pages 109-122  |  DOI:10.1007/BF02579168

Harold N. Gabow, Matthias Stallmann
An augmenting path algorithm for linear matroid parity
Pages 123-150  |  DOI:10.1007/BF02579169

Sergiu Hart, Micha Sharir
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
Pages 151-177  |  DOI:10.1007/BF02579170

Peter W. Shor
The average-case analysis of some on-line algorithms for bin packing
Pages 179-200  |  DOI:10.1007/BF02579171

Volume 6, Issue 3, 1986

Noga Alon
Covering graphs by the minimum number of equivalence relations
Pages 201-206  |  DOI:10.1007/BF02579381

Noga Alon
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory
Pages 207-219  |  DOI:10.1007/BF02579382

I. Bárány, L. A. Wolsey, J. Edmonds
Packing and covering a tree by subtrees
Pages 221-233  |  DOI:10.1007/BF02579383

M. A. Berger, A. Felzenbaum, A. S. Fraenkel
A non-analytic proof of the newman—znám result for disjoint covering systems
Pages 235-243  |  DOI:10.1007/BF02579384

R. Bodendiek, K. Wagner
A characterization of the minimalbasis of the torus
Pages 245-260  |  DOI:10.1007/BF02579385

Endre Boros, Tamás Szőnyi
On the sharpness of a theorem of B. segre
Pages 261-268  |  DOI:10.1007/BF02579386

Yoshimi Egawa, Hikoe Enomoto, Akira Saito
Contractible edges in triangle-free graphs
Pages 269-274  |  DOI:10.1007/BF02579387

Michele Elia
On the non-existence of barker sequences
Pages 275-278  |  DOI:10.1007/BF02579388

P. Frankl
Orthogonal vectors in then-dimensional cube and codes with missing distances
Pages 279-285  |  DOI:10.1007/BF02579389

Volume 6, Issue 4, 1986

Thomas Andreae
On well-quasi-ordering-finite graphs by immersion
Pages 287-298  |  DOI:10.1007/BF02579254

A. Bachem, W. Kern
Adjoints of oriented matroids
Pages 299-308  |  DOI:10.1007/BF02579255

D. de Caen, P. Erdős, N. J. Pullmann, N. C. Wormald
Extremal clique coverings of complementary graphs
Pages 309-314  |  DOI:10.1007/BF02579256

Collette R. Coullard
Counterexamples to conjectures on 4-connected matroids
Pages 315-320  |  DOI:10.1007/BF02579257

Stephen Dow
A completion problem for finite affine planes
Pages 321-325  |  DOI:10.1007/BF02579258

R. J. Faudree, R. H. Schelp, V. T. Sós
Some intersection theorems on two-valued functions
Pages 327-333  |  DOI:10.1007/BF02579259

P. Frankl, Z. Füredi
Finite projective spaces and intersecting hypergraphs
Pages 335-354  |  DOI:10.1007/BF02579260

Z. Füredi, J. R. Griggs
Families of finite sets with minimum shadows
Pages 355-363  |  DOI:10.1007/BF02579261

A. M. H. Gerards, A. Schrijver
Matrices with the edmonds—Johnson property
Pages 365-379  |  DOI:10.1007/BF02579262

W. -L. Hsu
Coloring planar perfect graphs by decomposition
Pages 381-385  |  DOI:10.1007/BF02579263

Howard J. Karloff
A las vegas rnc algorithm for maximum matching
Pages 387-391  |  DOI:10.1007/BF02579264

L. Pyber
Clique covering of graphs
Pages 393-398  |  DOI:10.1007/BF02579265

Volume 7, Issue 1, 1987

Noga Alon, Ravi B. Boppana
The monotone circuit complexity of boolean functions
Pages 1-22  |  DOI:10.1007/BF02579196

Anders Björner, Richard Stanley, Peter Frankl
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem
Pages 23-34  |  DOI:10.1007/BF02579197

B. Bollobás, A. G. Thomason
Threshold functions
Pages 35-38  |  DOI:10.1007/BF02579198

A. Dress, L. Lovász
On some combinatorial properties of algebraic matroids
Pages 39-48  |  DOI:10.1007/BF02579199

András Frank, Éva Tardos
An application of simultaneous diophantine approximation in combinatorial optimization
Pages 49-65  |  DOI:10.1007/BF02579200

Peter Frankl
On a pursuit game on cayley graphs
Pages 67-70  |  DOI:10.1007/BF02579201

Joel Friedman, Nicholas Pippenger
Expanding graphs contain all small trees
Pages 71-76  |  DOI:10.1007/BF02579202

J. I. Hall
A local characterization of the johnson scheme
Pages 77-85  |  DOI:10.1007/BF02579203

Eugene M. Luks
Computing the composition factors of a permutation group in polynomial time
Pages 87-99  |  DOI:10.1007/BF02579204

Ketan Mulmuley
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
Pages 101-104  |  DOI:10.1007/BF02579205

Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani
Matching is as easy as matrix inversion
Pages 105-113  |  DOI:10.1007/BF02579206

H. -J. Prömel, B. L. Rothschild
A canonical restricted version of van der waerden’s theorem
Pages 115-119  |  DOI:10.1007/BF02579207

Eli Shamir, Joel Spencer
Sharp concentration of the chromatic number on random graphsG n, p
Pages 121-129  |  DOI:10.1007/BF02579208

Micha Sharir
Almost linear upper bounds on the length of general davenport—schinzel sequences
Pages 131-143  |  DOI:10.1007/BF02579209

C. Thomassen
On digraphs with no two disjoint directed cycles
Pages 145-150  |  DOI:10.1007/BF02579210

Volume 7, Issue 2, 1987

N. Alon, D. J. Kleitman, C. Pomerance, M. Saks, P. Seymour
The smallestn-uniform hypergraph with positive discrepancy
Pages 151-160  |  DOI:10.1007/BF02579446

I. Bárány
An extension of the Erdős-Szekeres theorem on large angles
Pages 161-169  |  DOI:10.1007/BF02579447

T. N. Bui, S. Chaudhuri, F. T. Leighton, M. Sipser
Graph bisection algorithms with good average case behavior
Pages 171-191  |  DOI:10.1007/BF02579448

H. Gröflin
On switching paths polyhedra
Pages 193-204  |  DOI:10.1007/BF02579449

M. Kano
Maximum andk-th maximal spanning trees of a weighted graph
Pages 205-214  |  DOI:10.1007/BF02579450

Volume 7, Issue 3, 1987

H. L. Abbott, A. Liu
On a problem of Erdős concerning property B
Pages 215-219  |  DOI:10.1007/BF02579298

Marshall Bern, Alice Wong, Maria Klawe
Bounds on the convex label number of trees
Pages 221-230  |  DOI:10.1007/BF02579299

Robert E. Bixby, C. R. Coullard
Finding a small 3-connected minor maintaining a fixed minor and a fixed element
Pages 231-242  |  DOI:10.1007/BF02579300

André Bouchet
Reducing prime graphs and recognizing circle graphs
Pages 243-254  |  DOI:10.1007/BF02579301

P. Feofiloff, D. H. Younger
Directed cut transversal packing for source-sink connected graphs
Pages 255-263  |  DOI:10.1007/BF02579302

A. M. Frieze, B. Jackson
Large holes in sparse random graphs
Pages 265-274  |  DOI:10.1007/BF02579303

D. W. Matula
Expose-and-merge exploration and the chromatic number of a random graph
Pages 275-284  |  DOI:10.1007/BF02579304

J. E. Olson
A problem of Erdős on abelian groups
Pages 285-289  |  DOI:10.1007/BF02579305

Sharad S. Sane, Mohan S. Shrikhande
Quasi-symmetric 2, 3, 4-designs
Pages 291-301  |  DOI:10.1007/BF02579306

M. Stiebitz
Subgraphs of colour-critical graphs
Pages 303-312  |  DOI:10.1007/BF02579307

Volume 7, Issue 4, 1987

László Lovász, László Babai
Editors’ foreword
Page 313  |  DOI:10.1007/BF02579319

Richard Anderson
A parallel algorithm for the maximal path problem
Pages 315-326  |  DOI:10.1007/BF02579320

B. Bollobás, T. I. Fenner, A. M. Frieze
An algorithm for finding hamilton paths and cycles in random graphs
Pages 327-341  |  DOI:10.1007/BF02579321

Shuji Jimbo, Akira Maruoka
Expanders obtained from affine transformations
Pages 343-355  |  DOI:10.1007/BF02579322

Leonid A. Levin
One way functions and pseudorandom generators
Pages 357-363  |  DOI:10.1007/BF02579323

Prabhakar Raghavan, Clark D. Tompson
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Pages 365-374  |  DOI:10.1007/BF02579324

Umesh V. Vazirani
Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
Pages 375-392  |  DOI:10.1007/BF02579325

Volume 8, Issue 1, 1988

A. Aggarwal, R. J. Anderson
A random 1-011-011-01algorithm for depth first search
Pages 1-12  |  DOI:10.1007/BF02122548

R. Aharoni, P. Erdős, N. Linial
Optima of dual integer linear programs
Pages 13-20  |  DOI:10.1007/BF02122549

József Beck
On a lattice point problem of L. Moser. I
Pages 21-47  |  DOI:10.1007/BF02122550

B. Bollobás
The chromatic number of random graphs
Pages 49-55  |  DOI:10.1007/BF02122551

A. E. Brouwer, A. Neumaier
A remark on partial linear spaces of girth 5 with an application to strongly regular graphs
Pages 57-61  |  DOI:10.1007/BF02122552

R. Häggkvist, P. Hell, D. J. Miller, V. Neumann Lara
On multiplicative graphs and the product conjecture
Pages 63-74  |  DOI:10.1007/BF02122553

J. Hastad
Dual vectors and lower bounds for the nearest lattice point problem
Pages 75-81  |  DOI:10.1007/BF02122554

A. Kostochka, L. Pyber
Small topological complete subgraphs of “dense” graphs
Pages 83-86  |  DOI:10.1007/BF02122555

B. Lindström
A generalization of the ingleton—Main lemma and a class of non-algebraic matroids
Pages 87-90  |  DOI:10.1007/BF02122556

N. Linial, L. Lovász, A. Wigderson
Rubber bands, convex embeddings and graph connectivity
Pages 91-102  |  DOI:10.1007/BF02122557

A. Sebő
The Schrijver system of odd join polyhedra
Pages 103-116  |  DOI:10.1007/BF02122558

Micha Sharir
Improved lower bounds on the length of Davenport-Schinzel sequences
Pages 117-124  |  DOI:10.1007/BF02122559

P. Terwilliger
The classification of distance-regular graphs of type IIB
Pages 125-132  |  DOI:10.1007/BF02122560

L. Babai
A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality
Pages 133-135  |  DOI:10.1007/BF02122561

B. Grünbaum
The edge-density of 4-critical planar graphs
Pages 137-139  |  DOI:10.1007/BF02122562

É. Tardos
The gap between monotone and non-monotone circuit complexity is exponential
Pages 141-142  |  DOI:10.1007/BF02122563

Volume 8, Issue 2, 1988

M. Aigner, D. Grieser
Hook-free colorings and a problem of Hanson
Pages 143-148  |  DOI:10.1007/BF02122795

H. -J. Bandelt
Hereditary modular graphs
Pages 149-157  |  DOI:10.1007/BF02122796

József Beck
On a lattice point problem of L. Moser II
Pages 159-176  |  DOI:10.1007/BF02122797

Zh. A. Chernyak, A. A. Chernyak
Matrices with prescribed row, column and block sums
Pages 177-184  |  DOI:10.1007/BF02122798

J. Friedman
A lower bound on strictly non-blocking networks
Pages 185-188  |  DOI:10.1007/BF02122799

Z. Galil, V. Pan
Improved processor bounds for combinatorial problems in RNC
Pages 189-200  |  DOI:10.1007/BF02122800

J. Kincses
How big can the circuits of a bridge of a maximal circuit be?
Pages 201-205  |  DOI:10.1007/BF02122801

Mieko Yamada
On a relation between a cyclic relative difference set associated with the quadratic extensions of a finite field and the Szekeres difference sets
Pages 207-216  |  DOI:10.1007/BF02122802

G. M. Ziegler
Branchings in rooted graphs and the diameter of greedoids
Pages 217-234  |  DOI:10.1007/BF02122803

Volume 8, Issue 3, 1988

M. Ajtai
A lower bound for finding predecessors in Yao's cell probe model
Pages 235-247  |  DOI:10.1007/BF02126797

P. J. Cameron, M. Deza, P. Frankl
Intersection theorems in permutation groups
Pages 249-260  |  DOI:10.1007/BF02126798

A. Lubotzky, R. Phillips, P. Sarnak
Ramanujan graphs
Pages 261-277  |  DOI:10.1007/BF02126799

A. Rucinski, A. Vince
Balanced extensions of graphs and hypergraphs
Pages 279-291  |  DOI:10.1007/BF02126800

W. I. Chang, E. L. Lawler
Edge coloring of hypergraphs and a conjecture of ErdÖs, Faber, Lovász
Pages 293-295  |  DOI:10.1007/BF02126801

Volume 8, Issue 4, 1988

N. Alon, G. Freiman
On sums of subsets of a set of integers
Pages 297-306  |  DOI:10.1007/BF02189086

N. L. Biggs
Girth and residual finiteness
Pages 307-312  |  DOI:10.1007/BF02189087

P. A. Catlin
Contractions of graphs with no spanning eulerian subgraphs
Pages 313-321  |  DOI:10.1007/BF02189088

P. Frankl, V. Rödl
Some Ramsey-Turán type results for hypergraphs
Pages 323-332  |  DOI:10.1007/BF02189089

C. D. Godsil
Bounding the diameter of distance-regular graphs
Pages 333-343  |  DOI:10.1007/BF02189090

L. R. Mutafchiev
Limit theorem concerning random mapping patterns
Pages 345-356  |  DOI:10.1007/BF02189091

E. R. Scheinerman
Random interval graphs
Pages 357-371  |  DOI:10.1007/BF02189092

D. K. Wagner
Equivalent factor matroids of graphs
Pages 373-377  |  DOI:10.1007/BF02189093

Volume 9, Issue 1, 1989

V. Bergelson, N. Hindman
Ultrafilters and multidimensional Ramsey Theorems
Pages 1-7  |  DOI:10.1007/BF02122678

Z. Galil, R. Kannan, E. Szemerédi
On 3-pushdown graphs with large separators
Pages 9-19  |  DOI:10.1007/BF02122679

Dr. V. P. Grishuhin
Cones of alternating and cut submodular set functions
Pages 21-32  |  DOI:10.1007/BF02122680

R. Häggkvist, Y. Manoussakis
Cycles and paths in bipartite tournaments with spanning configurations
Pages 33-38  |  DOI:10.1007/BF02122681

T. Łuczak, J. C. Wierman
The chromatic number of random graphs at the double-jump threshold
Pages 39-49  |  DOI:10.1007/BF02122682

T. P. McDonough, V. C. Mavron
Symmetric designs and geometroids
Pages 51-57  |  DOI:10.1007/BF02122683

A. Neumaier
Duality in coherent configurations
Pages 59-67  |  DOI:10.1007/BF02122684

J. Oxley, D. Row
On fixing elements in matroid minors
Pages 69-74  |  DOI:10.1007/BF02122685

J. -P. Roudneff
Inseparability graphs of oriented matroids
Pages 75-84  |  DOI:10.1007/BF02122686

R. Simion, D. -S. Cao
Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
Pages 85-89  |  DOI:10.1007/BF02122687

J. Wojciechowski
A new lower bound for Snake-in-the-Box Codes
Pages 91-99  |  DOI:10.1007/BF02122688

E. Győri
On the number ofC 5′S in a triangle-free graph
Pages 101-102  |  DOI:10.1007/BF02122689

I. Křìž
A cycle-space invariant of the <2-distance-graph in the plane
Pages 103-105  |  DOI:10.1007/BF02122690

B. Lindström
Matroids algebraic overF(t) are algebraic overF
Pages 107-109  |  DOI:10.1007/BF02122691

Volume 9, Issue 2, 1989

F. R. K. Chung, R. L. Graham, M. E. Saks
A Dynamic location problem for graphs
Pages 111-131  |  DOI:10.1007/BF02124674

A. M. Frieze, A. M. Frieze
Survival time of a random graph
Pages 133-143  |  DOI:10.1007/BF02124675

W. Hochstättler, W. Kern
Matroid matching in pseudomodular lattices
Pages 145-152  |  DOI:10.1007/BF02124676

H. Lefmann
An extremal problem for Graham-Rothschild parameter words
Pages 153-160  |  DOI:10.1007/BF02124677

T. Leighton, P. Shor
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Pages 161-187  |  DOI:10.1007/BF02124678

E. Klafszky, T. Terlaky
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
Pages 189-198  |  DOI:10.1007/BF02124679

L. Rónyai
Factoring polynomials modulo special primes
Pages 199-206  |  DOI:10.1007/BF02124680

A. F. Sidorenko
Asymptotic solution for a new class of forbiddenr-graphs
Pages 207-215  |  DOI:10.1007/BF02124681

D. T. Todorov
Lower bounds for coverings of pairs by large blocks
Pages 217-225  |  DOI:10.1007/BF02124682

Igor Kříž
Ahypergraph-free construction of highly chromatic graphs without short cycles
Pages 227-229  |  DOI:10.1007/BF02124683

Jan Reiterman
A note on monotone paths in labeled graphs
Pages 231-232  |  DOI:10.1007/BF02124684

Volume 9, Issue 3, 1989

H. L. Abbott, D. R. Hare
Sparse color-critical hypergraphs
Pages 233-243  |  DOI:10.1007/BF02125892

P. Erdös, A. Gyárfás, E. T. Ordman, Y. Zalcstein
The size of chordal, interval and threshold subgraphs
Pages 245-253  |  DOI:10.1007/BF02125893

A. V. Ivanov
Non rank 3 strongly regular graphs with the 5-vertex condition
Pages 255-260  |  DOI:10.1007/BF02125894

H. A. Jung, M. E. Watkins
The connectivities of locally finite primitive graphs
Pages 261-267  |  DOI:10.1007/BF02125895

D. Lichtenstein, N. Linial, M. Saks
Some extremal problems arising from discrete control processes
Pages 269-287  |  DOI:10.1007/BF02125896

D. Peleg, E. Upfal
Constructing disjoint paths on expander graphs
Pages 289-313  |  DOI:10.1007/BF02125897

L. Rónyai, T. SzŐnyi
Planar functions over finite fields
Pages 315-320  |  DOI:10.1007/BF02125898

Volume 9, Issue 4, 1989

E. Balas, W. R. Pulleyblank
The perfectly Matchable Subgraph Polytope of an arbitrary graph
Pages 321-337  |  DOI:10.1007/BF02125345

A. E. Brouwer, A. V. Ivanov, M. H. Klin
Some new strongly regular graphs
Pages 339-344  |  DOI:10.1007/BF02125346

F. R. K. Chung, R. L. Graham, R. M. Wilson
Quasi-random graphs
Pages 345-362  |  DOI:10.1007/BF02125347

A. M. Frieze, C. J. H. McDiarmid
On random minimum length spanning trees
Pages 363-374  |  DOI:10.1007/BF02125348

A. Schrijver
The Klein bottle and multicommodity flows
Pages 375-384  |  DOI:10.1007/BF02125349

G. Tardos
Query complexity, or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?
Pages 385-392  |  DOI:10.1007/BF02125350

N. Alon, M. Tarsi
A nowhere-zero point in linear mappings
Pages 393-395  |  DOI:10.1007/BF02125351

Volume 10, Issue 1, 1990

W. Aiello, S. Goldwasser, J. Hastad
On the power of interaction
Pages 3-25  |  DOI:10.1007/BF02122692

I. Csiszár, J. Körner, L. Lovász, K. Marton, G. Simonyi
Entropy splitting for antiblocking corners and perfect graphs
Pages 27-40  |  DOI:10.1007/BF02122693

H. De Fraysseix, J. Pach, R. Pollack
How to draw a planar graph on a grid
Pages 41-51  |  DOI:10.1007/BF02122694

V. King
A lower bound for the recognition of digraph properties
Pages 53-59  |  DOI:10.1007/BF02122695

M. Las Vergnas
An upper bound for the number of Eulerian orientations of a regular graph
Pages 61-65  |  DOI:10.1007/BF02122696

S. Nakano, T. Nishizeki, N. Saito
On thefg-coloring of graphs
Pages 67-80  |  DOI:10.1007/BF02122697

A. A. Razborov
Applications of matrix methods to the theory of lower bounds in computational complexity
Pages 81-93  |  DOI:10.1007/BF02122698

J. Spencer
Infinite spectra in the first order theory of graphs
Pages 95-102  |  DOI:10.1007/BF02122699

P. G. Bonneau
Weight distribution of translates of MDS codes
Pages 103-105  |  DOI:10.1007/BF02122700

C. H. Papadimitriou, M. Yannakakis
On recognizing integer polyhedra
Pages 107-109  |  DOI:10.1007/BF02122701

Volume 10, Issue 2, 1990

Gábor Fejes Tóth, János Pach
Foreword
Pages 113-114  |  DOI:10.1007/BF02123005

R. Alexander
Geometric methods in the study of irregularities of distribution
Pages 115-136  |  DOI:10.1007/BF02123006

B. Aronov, M. Sharir
Triangles in space or building (and analyzing) castles in the air
Pages 137-173  |  DOI:10.1007/BF02123007

I. Bárány, Z. Füredi, L. Lovász
On the number of halving planes
Pages 175-183  |  DOI:10.1007/BF02123008

I. Bárány, M. Perles
The caratheodory number for thek-core
Pages 185-194  |  DOI:10.1007/BF02123009

T. Bisztriczky, G. Fejes Tóth
Convexly independent sets
Pages 195-202  |  DOI:10.1007/BF02123010

H. L. Bodlaender, P. Gritzmann, V. Klee, J. Van Leeuwen
Computational complexity of norm-maximization
Pages 203-225  |  DOI:10.1007/BF02123011

Volume 10, Issue 3, 1990

B. Chazelle, J. Friedman
A deterministic view of random sampling and its use in geometry
Pages 229-249  |  DOI:10.1007/BF02122778

H. Edelsbrunner
An acyclicity theorem for cell complexes ind dimension
Pages 251-260  |  DOI:10.1007/BF02122779

P. Erdős, J. Pach
Variations on the theme of repeated distances
Pages 261-269  |  DOI:10.1007/BF02122780

G. Kalai
On low-dimensional faces that high-dimensional polytopes must have
Pages 271-280  |  DOI:10.1007/BF02122781

M. Laczkovich
Tilings of polygons with similar triangles
Pages 281-306  |  DOI:10.1007/BF02122782

R. Pollack, R. Wenger
Necessary and sufficient conditions for hyperplane transversals
Pages 307-311  |  DOI:10.1007/BF02122783

V. P. Soltan, Nguen Man Hung
Some notes about affine diameters of convex figures
Pages 313-317  |  DOI:10.1007/BF02122784

Volume 10, Issue 4, 1990

Noga Alon
The maximum number of Hamiltonian paths in tournaments
Pages 319-324  |  DOI:10.1007/BF02128667

András Frank
Packing paths in planar graphs
Pages 325-331  |  DOI:10.1007/BF02128668

J. C. Lagarias, H. W. Lenstra Jr., C. P. Schnorr
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
Pages 333-348  |  DOI:10.1007/BF02128669

Nathan Linial, Noam Nisan
Approximate Inclusion-Exclusion
Pages 349-365  |  DOI:10.1007/BF02128670

Brendan D. McKay
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
Pages 367-377  |  DOI:10.1007/BF02128671

P. D. Seymour
Colouring series-parallel graphs
Pages 379-392  |  DOI:10.1007/BF02128672

A. Blokhuis
Solution of an extremal problem for sets using resultants of polynomials
Pages 393-396  |  DOI:10.1007/BF02128673

Volume 11, Issue 1, 1991

K. T. Arasu, James Davis, Dieter Jungnickel, Alexander Pott
Some non-existence results on divisible difference sets
Pages 1-8  |  DOI:10.1007/BF01375467

Endre Boros, Dieter Jungnickel, Scott A. Vanstone
The existence of non-trivial hyperfactorizations ofK 2n
Pages 9-15  |  DOI:10.1007/BF01375468

Jeff Kahn, Roy Meshulam
On modp transversals
Pages 17-22  |  DOI:10.1007/BF01375469

Valerie King
An Ω(n 5/4) lower bound on the randomized complexity of graph properties
Pages 23-32  |  DOI:10.1007/BF01375470

Donald E. Knuth
Efficient representation of perm groups
Pages 33-43  |  DOI:10.1007/BF01375471

Tomasz Łuczak
The chromatic number of random graphs
Pages 45-54  |  DOI:10.1007/BF01375472

Victor Neumann-Lara, Eduardo Rivera-Campo
Spanning trees with bounded degrees
Pages 55-61  |  DOI:10.1007/BF01375473

Noam Nisan
Pseudorandom bits for constant depth circuits
Pages 63-70  |  DOI:10.1007/BF01375474

Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto
A mixed version of Menger's theorem
Pages 71-74  |  DOI:10.1007/BF01375475

Zoltán Füredi
On a Turán type problem of Erdös
Pages 75-79  |  DOI:10.1007/BF01375476

Volume 11, Issue 2, 1991

R. E. L. Aldred, D. A. Holton, Bill Jackson
Uniform cyclic edge connectivity in cubic graphs
Pages 81-96  |  DOI:10.1007/BF01206354

N. Alon, Y. Azar
Parallel comparison algorithms for approximation problems
Pages 97-122  |  DOI:10.1007/BF01206355

Roland Häggkvist, Andrew Thomason
Trees in tournaments
Pages 123-130  |  DOI:10.1007/BF01206356

Péter Hajnal
An Ω(n 4/3) lower bound on the randomized complexity of graph properties
Pages 131-143  |  DOI:10.1007/BF01206357

Nora Hartsfield, Gerhard Ringel
Clean triangulations
Pages 145-155  |  DOI:10.1007/BF01206358

Bala Kalyanasundaram, Georg Schnitger
On the power of white pebbles
Pages 157-171  |  DOI:10.1007/BF01206359

Xiaoyun Lu
On claws belonging to every tournament
Pages 173-179  |  DOI:10.1007/BF01206360

András Gyárfás, Jenő Lehel
Effective on-line coloring ofP 5-free graphs
Pages 181-184  |  DOI:10.1007/BF01206361

Volume 11, Issue 3, 1991

H. L. Abbott, B. Zhou
The edge density of 4-critical planar graphs
Pages 185-189  |  DOI:10.1007/BF01205071

J. A. Bondy, Genghua Fan
Cycles in weighted graphs
Pages 191-205  |  DOI:10.1007/BF01205072

Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtěch Rödl
The number oft-wise balanced designs
Pages 207-218  |  DOI:10.1007/BF01205073

William H. Cunningham, Jan Green-Krótki
b-matching degree-sequence polyhedra
Pages 219-230  |  DOI:10.1007/BF01205074

Ervin Győri
On the number of edge disjoint cliques in graphs of given size
Pages 231-243  |  DOI:10.1007/BF01205075

Y. Kohayakawa
A note on induced cycles in Kneser graphs
Pages 245-251  |  DOI:10.1007/BF01205076

Hans Jürgen Prömel, Bernd Voigt
Graham-Rothschild parameter words and measurable partitions
Pages 253-259  |  DOI:10.1007/BF01205077

P. D. Seymour
Directed circuits on a torus
Pages 261-273  |  DOI:10.1007/BF01205078

Bernd Sturmfels, Neil White
Computing combinatorial decompositions of rings
Pages 275-293  |  DOI:10.1007/BF01205079

Tomasz Luczak
A note on the sharp concentration of the chromatic number of random graphs
Pages 295-297  |  DOI:10.1007/BF01205080

Volume 11, Issue 4, 1991

Béla Bollobás, Imre Leader
Edge-isoperimetric inequalities in the grid
Pages 299-314  |  DOI:10.1007/BF01275667

André Bouchet
An efficient algorithm to recognize locally equivalent graphs
Pages 315-329  |  DOI:10.1007/BF01275668

Joel Friedman
On the second eigenvalue and random walks in randomd-regular graphs
Pages 331-362  |  DOI:10.1007/BF01275669

Jeff Kahn, Nathan Linial
Balancing extensions via Brunn-Minkowski
Pages 363-368  |  DOI:10.1007/BF01275670

Brendan D. McKay, Nicholas C. Wormald
Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)
Pages 369-382  |  DOI:10.1007/BF01275671

Michael E. Saks, Michael Werman
On computing majority by comparisons
Pages 383-387  |  DOI:10.1007/BF01275672

Yoshimi Egawa, Akira Saito
Contractible edges in non-separating cycles
Pages 389-392  |  DOI:10.1007/BF01275673

Carsten Thomassen
Highly connected non-2-linked digraphs
Pages 393-395  |  DOI:10.1007/BF01275674

Volume 12, Issue 1, 1992

R. Ahlswede, N. Cai, Z. Zhang
Diametric theorems in sequence spaces
Pages 1-17  |  DOI:10.1007/BF01191200

V. Chvátal, C. McDiarmid
Small transversals in hypergraphs
Pages 19-26  |  DOI:10.1007/BF01191201

W. Cook, M. Hartmann, R. Kannan, C. McDiarmid
On integer points in polyhedra
Pages 27-37  |  DOI:10.1007/BF01191202

Paul Erdős, Ron Graham, Imre Z. Ruzsa, Herbert Taylor
Bounds for arrays of dots with distinct slopes or lengths
Pages 39-44  |  DOI:10.1007/BF01191203

A. K. Kelmans
Spanning trees of extended graphs
Pages 45-51  |  DOI:10.1007/BF01191204

Gary L. Miller, Vijaya Ramachandran
A new graph triconnectivity algorithm and its parallelization
Pages 53-76  |  DOI:10.1007/BF01191205

Tomaž Pisanski, Thomas W. Tucker, Dave Witte
The non-orientable genus of some metacyclic groups
Pages 77-87  |  DOI:10.1007/BF01191206

Alexander Pott
New necessary conditions on the existence of abelian difference sets
Pages 89-93  |  DOI:10.1007/BF01191207

Rajamani Sundar
On the deque conjecture for the splay algorithm
Pages 95-124  |  DOI:10.1007/BF01191208

Volume 12, Issue 2, 1992

N. Alon, M. Tarsi
Colorings and orientations of graphs
Pages 125-134  |  DOI:10.1007/BF01204715

Imre Bárány, Roger Howe, László Lovász
On integer points in polyhedra: A lower bound
Pages 135-142  |  DOI:10.1007/BF01204716

A. Blokhuis, Á Seress, H. A. Wilbrink
Characterization of complete exterior sets of conics
Pages 143-147  |  DOI:10.1007/BF01204717

D. M. Jackson, L. B. Richmond
The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line
Pages 149-153  |  DOI:10.1007/BF01204718

Jeff Kahn, P. D. Seymour
A fractional version of the Erdős-Faber-Lovász conjecture
Pages 155-160  |  DOI:10.1007/BF01204719

Ravi Kannan
Lattice translates of a polytope and the Frobenius problem
Pages 161-177  |  DOI:10.1007/BF01204720

János Körner, Gábor Simonyi, Zsolt Tuza
Perfect couples of graphs
Pages 179-192  |  DOI:10.1007/BF01204721

Kevin McAvaney, Jack Robertson, William Webb
Ramsey partitions of integers and fair divisions
Pages 193-201  |  DOI:10.1007/BF01204722

P. McMullen, E. Schulte
Regular polytopes of type {4,4,3} and {4,4,4}
Pages 203-220  |  DOI:10.1007/BF01204723

P. Pudlák, V. Rödl
A combinatorial approach to complexity
Pages 221-226  |  DOI:10.1007/BF01204724

Tamás Szőnyi
Note on the existence of large minimal blocking sets in galois planes
Pages 227-235  |  DOI:10.1007/BF01204725

Takayuki Hibi
Note dual polytopes of rational convex polytopes
Pages 237-240  |  DOI:10.1007/BF01204726

Gyula Y. Katona
Note searching forf-hamiltonian circuits
Pages 241-245  |  DOI:10.1007/BF01204727

Volume 12, Issue 3, 1992

Ron M. Adin
Counting colorful multi-dimensional trees
Pages 247-260  |  DOI:10.1007/BF01285814

B. Aronov, H. Edelsbrunner, L. J. Guibas, M. Sharir
The number of edges of many faces in a line segment arrangement
Pages 261-274  |  DOI:10.1007/BF01285815

Patrick Chiu
Cubic Ramanujan graphs
Pages 275-285  |  DOI:10.1007/BF01285816

Péter L. Erdős, P. Frankl, D. J. Kleitman, M. E. Saks, L. A. Székely
Sharpening the LYM inequality
Pages 287-293  |  DOI:10.1007/BF01285817

Péter Hajnal, Márió Szegedy
On packing bipartite graphs
Pages 295-301  |  DOI:10.1007/BF01285818

Ron Holzman, Daniel J. Kleitman
On the product of sign vectors and unit vectors
Pages 303-316  |  DOI:10.1007/BF01285819

T. D. Porter
On a bottleneck bipartition conjecture of Erdős
Pages 317-321  |  DOI:10.1007/BF01285820

Wansoo T. Rhee, Michel Talagrand
On the long edges in the shortest tour throughN random points
Pages 323-330  |  DOI:10.1007/BF01285821

Wansoo T. Rhee, Michel Talagrand
Packing random items of three colors
Pages 331-350  |  DOI:10.1007/BF01285822

Attila Sali
Some intersection theorems
Pages 351-361  |  DOI:10.1007/BF01285823

Amha Tume Lisan
Multi-dimensional Ramsey theorems — An example
Pages 363-365  |  DOI:10.1007/BF01285824

Dezső Miklós
Disproof of a conjecture in graph reconstruction theory
Pages 367-369  |  DOI:10.1007/BF01285825

Volume 12, Issue 4, 1992

R. L. Graham
Erratum
Page i  |  DOI:10.1007/BF01305227

László Babai, Vera T. Sós
Tibor Gallai, 1912–1992
Pages 370-372  |  DOI:10.1007/BF01305228


In memory of Tibor Gallai Paul Erdős
Pages 373-374  |  DOI:10.1007/BF01305229

Noga Alon, Colin McDiarmid, Bruce Reed
Star arboricity
Pages 375-380  |  DOI:10.1007/BF01305230

V. G. Boltjanski, P. S. Soltan
A solution of Hadwiger's covering problem for zonoids
Pages 381-388  |  DOI:10.1007/BF01305231

Jin-Yi Cai, Martin Fürer, Neil Immerman
An optimal lower bound on the number of variables for graph identification
Pages 389-410  |  DOI:10.1007/BF01305232

Ehud Hrushovski
Extending partial isomorphisms of graphs
Pages 411-416  |  DOI:10.1007/BF01305233

Jeff Kahn
On a problem of Erdős and Lovász: Random lines in a projective plane
Pages 417-423  |  DOI:10.1007/BF01305234

S. L. Ma
Reversible relative difference sets
Pages 425-432  |  DOI:10.1007/BF01305235

Ernst W. Mayr, C. Greg Plaxton
On the spanning trees of weighted graphs
Pages 433-447  |  DOI:10.1007/BF01305236

Noam Nisan
Pseudorandom generators for space-bounded computation
Pages 449-461  |  DOI:10.1007/BF01305237

H. J. Prömel, A. Steger
The asymptotic number of graphs not containing a fixed color-critical subgraph
Pages 463-473  |  DOI:10.1007/BF01305238

Thomas Stehling
On computing the number of subgroups of a finite Abelian group
Pages 475-479  |  DOI:10.1007/BF01305239

Carsten Thomassen
The Hadwiger number of infinite vertex-transitive graphs
Pages 481-491  |  DOI:10.1007/BF01305240

P. Frankl
The convex hull of antichains in posets
Pages 493-496  |  DOI:10.1007/BF01305241

Volume 13, Issue 1, 1993

Béla Bollobás, Paul Erdős, Joel Spencer, Douglas B. West
Clique coverings of the edges of a random graph
Pages 1-5  |  DOI:10.1007/BF01202786

Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner
Decomposition of 3-connected graphs
Pages 7-30  |  DOI:10.1007/BF01202787

P. Erdős, A. Hajnal, M. Simonovits, V. T. Sós, E. Szemerédi
Turán-Ramsey theorems and simple asymptotically extremal structures
Pages 31-56  |  DOI:10.1007/BF01202788

P. Erdős, L. B. Richmond
On graphical partitions
Pages 57-63  |  DOI:10.1007/BF01202789

András Frank
Conservative weightings and ear-decompositions of graphs
Pages 65-81  |  DOI:10.1007/BF01202790

George S. Lueker, Mariko Molodowitch
More analysis of double hashing
Pages 83-96  |  DOI:10.1007/BF01202791

Matthias Middendorf, Frank Pfeiffer
On the complexity of the disjoint paths problem
Pages 97-107  |  DOI:10.1007/BF01202792

Alexander Sidorenko
Boundedness of optimal matrices in extremal multigraph and digraph problems
Pages 109-120  |  DOI:10.1007/BF01202793

Oleg Borodin
Joint extension of two theorems of Kotzig on 3-polytopes
Pages 121-125  |  DOI:10.1007/BF01202794

Zhen Zhang
A note on arrays of dots with distinct slopes
Pages 127-128  |  DOI:10.1007/BF01202795

Volume 13, Issue 2, 1993

Miklós Ajtai, Nathan Linial
The influence of large coalitions
Pages 129-145  |  DOI:10.1007/BF01303199

Béla Bollobás, Graham Brightwell
Cycles through specified vertices
Pages 147-155  |  DOI:10.1007/BF01303200

R. Cordovil, M. L. Moreira
Bases-cobases graphs and polytopes of matroids
Pages 157-165  |  DOI:10.1007/BF01303201

Z. Füredi, J. Kahn, P. D. Seymour
On the fractional matching polytope of a hypergraph
Pages 167-180  |  DOI:10.1007/BF01303202

Thomas C. Hales
Remarks on the density of sphere packings in three dimensions
Pages 181-197  |  DOI:10.1007/BF01303203

Peter L. Hammer, Frédéric Maffray
Preperfect graphs
Pages 199-208  |  DOI:10.1007/BF01303204

W. C. Stephen Suen
On depth first search strees inm-out digraphs
Pages 209-229  |  DOI:10.1007/BF01303205

M. Blidia, P. Duchet, F. Maffray
On kernels in perfect graphs
Pages 231-233  |  DOI:10.1007/BF01303206

Joel Friedman
A note on matrix rigidity
Pages 235-239  |  DOI:10.1007/BF01303207

Volume 13, Issue 3, 1993

Rudolf Ahlswede, Ning Cai
A generalization of the AZ identity
Pages 241-247  |  DOI:10.1007/BF01202350

Yaakov S. Kupitz
Separation of a finite set in ℝ d by spanned hyperplanes
Pages 249-258  |  DOI:10.1007/BF01202351

Jürgen Richter-Gebert
Euclideaness and final polynomials in oriented matroid theory
Pages 259-268  |  DOI:10.1007/BF01202352

Yosef Rinott, Michael Saks
Correlation inequalities and a conjecture for permanents
Pages 269-277  |  DOI:10.1007/BF01202353

Neil Robertson, Paul Seymour, Robin Thomas
Hadwiger's conjecture forK 6-free graphs
Pages 279-361  |  DOI:10.1007/BF01202354

M. Seysen
Simultaneous reduction of a lattice basis and its reciprocal basis
Pages 363-376  |  DOI:10.1007/BF01202355

Volume 13, Issue 4, 1993

Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald
Infinite highly arc transitive digraphs and universal covering digraphs
Pages 377-396  |  DOI:10.1007/BF01303511

M. Deza, V. P. Grishukhin, M. Laurent
The hypermetric cone is polyhedral
Pages 397-411  |  DOI:10.1007/BF01303512

Peter Frankl, Norihide Tokushige
Weight functions on the Kneser graph and the solution of an intersection problem of Sali
Pages 413-420  |  DOI:10.1007/BF01303513

Pavol Hell, Huishan Zhou, Xuding Zhu
Homomorphisms to oriented cycles
Pages 421-433  |  DOI:10.1007/BF01303514

K. Kilakos, B. Reed
Fractionally colouring total graphs
Pages 435-440  |  DOI:10.1007/BF01303515

Nathan Linial, Michael Saks
Low diameter graph decompositions
Pages 441-454  |  DOI:10.1007/BF01303516

Jiří Matoušek, Emo Welzl, Lorenz Wernisch
Discrepancy and approximations for bounded VC-dimension
Pages 455-466  |  DOI:10.1007/BF01303517

James Oxley, Geoff Whittle
Some excluded-minor theorems for a class of polymatroids
Pages 467-476  |  DOI:10.1007/BF01303518

Karen Seyffarth
Small cycle double covers of 4-connected planar graphs
Pages 477-482  |  DOI:10.1007/BF01303519

Micha Sharir
k-sets and random hulls
Pages 483-495  |  DOI:10.1007/BF01303520

Volume 14, Issue 1, 1994

K. Cameron, H. Sachs
Monotone path systems in simple regions
Pages 1-21  |  DOI:10.1007/BF01305947

Guo-Li Ding, Paul Seymour, Peter Winkler
Bounding the vertex cover number of a hypergraph
Pages 23-34  |  DOI:10.1007/BF01305948

Craig Gotsman, Nathan Linial
Spectral properties of threshold functions
Pages 35-50  |  DOI:10.1007/BF01305949

V. Jha, N. L. Johnson
A characterisation of spreads ovally-derived from Desarguesian spreads
Pages 51-61  |  DOI:10.1007/BF01305950

G. Korchmáros, F. Mazzocca
Nuclei of point sets of sizeq+1 contained in the union of two lines inPG(2,q)
Pages 63-69  |  DOI:10.1007/BF01305951

Vijay V. Vazirani
A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt V E)\) general graph maximum matching algorithm
Pages 71-109  |  DOI:10.1007/BF01305952

Aart Blokhuis
On the size of a blocking set inPG(2,p)
Pages 111-114  |  DOI:10.1007/BF01305953

P. Frankl, M. Watanabe
Density results for uniform families
Pages 115-119  |  DOI:10.1007/BF01305954

P. Komjáth, J. Pach
The complexity of a class of infinite graphs
Pages 121-125  |  DOI:10.1007/BF01305955

Volume 14, Issue 2, 1994

B. Aronov, P. Erdős, W. Goddard, D. J. Kleitman, M. Klugerman, J. Pach
Crossing families
Pages 127-134  |  DOI:10.1007/BF01215345

J. Aspnes, R. Beigel, M. Furst, S. Rudich
The expressive power of voting polynomials
Pages 135-148  |  DOI:10.1007/BF01215346

R. D. Baker, J. Bonin, F. Lazebnik, E. Shustin
On the number of nowhere zero points in linear mappings
Pages 149-157  |  DOI:10.1007/BF01215347

M. El-Zahar, N. Sauer
On the divisibility of homogeneous hypergraphs
Pages 159-165  |  DOI:10.1007/BF01215348

F. T. Leighton, Bruce M. Maggs, Satish B. Rao
Packet routing and job-shop scheduling inO(congestion+dilation) steps
Pages 167-186  |  DOI:10.1007/BF01215349

D. Marušič, R. Scapellato
Classifying vertex-transitive graphs whose order is a product of two primes
Pages 187-201  |  DOI:10.1007/BF01215350

P. Pudlák
Communication in bounded depth circuits
Pages 203-216  |  DOI:10.1007/BF01215351

P. D. Seymour, R. Thomas
Call routing and the ratcatcher
Pages 217-241  |  DOI:10.1007/BF01215352

J. Bang-Jensen, Y. Manoussakis
Cycles throughk vertices in bipartite tournaments
Pages 243-246  |  DOI:10.1007/BF01215353

Volume 14, Issue 3, 1994

L. Allys
Minimally 3-connected isotropic systems
Pages 247-262  |  DOI:10.1007/BF01212973

Antal Balog, Endre Szemerédi
A statistical theorem of set addition
Pages 263-268  |  DOI:10.1007/BF01212974

Vitaly Bergelson, Neil Hindman
On IP* sets and central sets
Pages 269-277  |  DOI:10.1007/BF01212975

B. Bollobás, Y. Kohayakawa
An extension of the Erdős-Stone theorem
Pages 279-286  |  DOI:10.1007/BF01212976

Zoltán Füredi, D. J. Kleitman
The prison yard problem
Pages 287-300  |  DOI:10.1007/BF01212977

Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu
Every arrangement extends to a spread
Pages 301-306  |  DOI:10.1007/BF01212978

Kejie Ma, Huishan Zhou, Jianqin Zhou
On the ascending star subgraph decomposition of star forests
Pages 307-320  |  DOI:10.1007/BF01212979

Sean McGuinness
Restricted greedy clique decompositions and greedy clique decompositions ofK 4-free graphs
Pages 321-334  |  DOI:10.1007/BF01212980

Sean McGuinness
Greedy maximum-clique decompositions
Pages 335-343  |  DOI:10.1007/BF01212981

Jaikumar Radhakrishnan
∑II∑ threshold formulas
Pages 345-374  |  DOI:10.1007/BF01212982

Dragomir Ž. Đoković
Two Hadamard matrices of order 956 of Goethals-Seidel type
Pages 375-377  |  DOI:10.1007/BF01212983

Volume 14, Issue 4, 1994

M. Ajtai
Recursive construction for 3-regular expanders
Pages 379-416  |  DOI:10.1007/BF01302963

M. Ajtai
The complexity of the Pigeonhole Principle
Pages 417-433  |  DOI:10.1007/BF01302964

Joseph Cheriyan, John H. Reif
Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity
Pages 435-451  |  DOI:10.1007/BF01302965

Myung S. Chung, Douglas B. West
Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
Pages 453-461  |  DOI:10.1007/BF01302966

Martin Klazar, Pavel Valtr
Generalized Davenport-Schinzel sequences
Pages 463-476  |  DOI:10.1007/BF01302967

Rögnvaldur G. Möller
Primitivity and ends of graphs
Pages 477-484  |  DOI:10.1007/BF01302968

Imre Z. Ruzsa
Sum of sets in several dimensions
Pages 485-490  |  DOI:10.1007/BF01302969

Jerzy Wojciechowski
Covering the hypercube with a bounded number of disjoint snakes
Pages 491-496  |  DOI:10.1007/BF01302970

Volume 15, Issue 1, 1995

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
The complexity of computing the tutte polynomial on transversal matroids
Pages 1-10  |  DOI:10.1007/BF01294456

Persi Diaconis, Michael Mc Grath, Jim Pitman
Riffle shuffles, cycles, and descents
Pages 11-29  |  DOI:10.1007/BF01294457

Joel Friedman
Some graphs with small second eigenvalue
Pages 31-42  |  DOI:10.1007/BF01294458

Joel Friedman, Avi Wigderson
On the second eigenvalue of hypergraphs
Pages 43-65  |  DOI:10.1007/BF01294459

Alan Frieze, Mark Jerrum
An analysis of a Monte Carlo algorithm for estimating the permanent
Pages 67-83  |  DOI:10.1007/BF01294460

Hanno Lefmann, Vojtěch Rödl
On Erdős-Rado numbers
Pages 85-104  |  DOI:10.1007/BF01294461

Klaus Metsch
On the number of lines in planar spaces
Pages 105-110  |  DOI:10.1007/BF01294462

Moshe Morgenstern
Natural bounded concentrators
Pages 111-122  |  DOI:10.1007/BF01294463

Gábor Tardos
Transversals of 2-intervals, a topological approach
Pages 123-134  |  DOI:10.1007/BF01294464

Dorothea Wagner, Karsten Weihe
A linear-time algorithm for edge-disjoint paths in planar graphs
Pages 135-150  |  DOI:10.1007/BF01294465

Volume 15, Issue 2, 1995

Timothy Y. Chow
Penny-packings with minimal second moments
Pages 151-158  |  DOI:10.1007/BF01200751

Guoli Ding
Bounding the number of bases of a matroid
Pages 159-165  |  DOI:10.1007/BF01200752

G. Elekes
Circle grids and bipartite graphs of distances
Pages 167-174  |  DOI:10.1007/BF01200753

David A. Grable, Kevin T. Phelps, Vojtěch Rödl
The minimum independence number for designs
Pages 175-185  |  DOI:10.1007/BF01200754

Philip Klein, Satish Rao, Ajit Agrawal, R. Ravi
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
Pages 187-202  |  DOI:10.1007/BF01200755

Dror Lapidot, Adi Shamir
A one-round, two-prover, zero-knowledge protocol for NP
Pages 203-214  |  DOI:10.1007/BF01200756

Nathan Linial, Eran London, Yuri Rabinovich
The geometry of graphs and some of its algorithmic applications
Pages 215-245  |  DOI:10.1007/BF01200757

Xiaoyun Lu
Hamiltonian cycles in bipartite graphs
Pages 247-254  |  DOI:10.1007/BF01200758

Alessandro Panconesi, Aravind Srinivasan
The local nature of Δ-coloring and its algorithmic applications
Pages 255-280  |  DOI:10.1007/BF01200759

P. D. Seymour
Packing directed circuits fractionally
Pages 281-288  |  DOI:10.1007/BF01200760

D. A. Youngs
Minimal orientations of colour critical graphs
Pages 289-295  |  DOI:10.1007/BF01200761

David Rubinstein
Sensitivity vs. block sensitivity of Boolean functions
Pages 297-299  |  DOI:10.1007/BF01200762

Volume 15, Issue 3, 1995

Noga Alon, Moshe Dubiner
A lattice point problem and additive number theory
Pages 301-309  |  DOI:10.1007/BF01299737

K. T. Arasu, James A. Davis, J. Jedwab
A nonexistence result for abelian menon difference sets using perfect binary arrays
Pages 311-317  |  DOI:10.1007/BF01299738

Jason Cooper, Nathan Linial
Fast perfect-information leader-election protocols with linear immunity
Pages 319-332  |  DOI:10.1007/BF01299739

Walter A. Deuber, Neil Hindman, Imre Leader, Hanno Lefmann
Infinite partition regular matrices
Pages 333-355  |  DOI:10.1007/BF01299740

Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu
Non-contractible edges in a 3-connected graph
Pages 357-364  |  DOI:10.1007/BF01299741

Bernhard Herwig
Extending partial isomorphisms on finite structures
Pages 365-371  |  DOI:10.1007/BF01299742

T. R. Jensen, F. B. Shepherd
Note on a conjecture of toft
Pages 373-377  |  DOI:10.1007/BF01299743

Hanno Lefmann, Torsten Thiele
Point sets with distinct distances
Pages 379-408  |  DOI:10.1007/BF01299744

Jesús A. De Loera, Bernd Sturmfels, Rekha R. Thomas
Gröbner bases and triangulations of the second hypersimplex
Pages 409-424  |  DOI:10.1007/BF01299745

Serge Plotkin, Éva Tardos
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Pages 425-434  |  DOI:10.1007/BF01299746

David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
A primal-dual approximation algorithm for generalized steiner network problems
Pages 435-454  |  DOI:10.1007/BF01299747

Volume 15, Issue 4, 1995

H. L. Abbott, D. R. Hare, B. Zhou
Large faces in 4-critical planar graphs with minimum degree 4
Pages 455-467  |  DOI:10.1007/BF01192518

H. L. Abbott, B. Zhou
Some remarks on (k−1)-critical subgraphs ofk-critical graphs
Pages 469-474  |  DOI:10.1007/BF01192519

Rudolf Ahlswede, Péter L. Erdős, Niall Graham
A splitting property of maximal antichains
Pages 475-480  |  DOI:10.1007/BF01192520

K. Coolsaet
Local structure of graphs with λ=μ=2,a 2=4
Pages 481-487  |  DOI:10.1007/BF01192521

Alan Frieze, Bruce Reed
Covering the edges of a random graph by cliques
Pages 489-497  |  DOI:10.1007/BF01192522

M. X. Goemans, V. S. Ramakrishnan
Minimizing submodular functions over families of sets
Pages 499-513  |  DOI:10.1007/BF01192523

Satoru Iwata
Principal structure of submodular systems and hitchcock-type independent flows
Pages 515-532  |  DOI:10.1007/BF01192524

W. Mader
Exixtence of vertices of local connectivityk in digraphs of large outdegree
Pages 533-539  |  DOI:10.1007/BF01192525

Bojan Mohar
Uniqueness and minimality of large face-width embeddings of graphs
Pages 541-556  |  DOI:10.1007/BF01192526

Noam Nisan, Avi Wigderson
On rank vs. communication complexity
Pages 557-565  |  DOI:10.1007/BF01192527

Ran Raz, Boris Spieker
On the “log rank”-conjecture in communication complexity
Pages 567-588  |  DOI:10.1007/BF01192528

V. Rödl, N. Sauer, X. Zhu
Ramsey families which exclude a graph
Pages 589-596  |  DOI:10.1007/BF01192529

Volume 16, Issue 1, 1996

Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial
Biased random walks
Pages 1-18  |  DOI:10.1007/BF01300124

James D. Currie
Non-repetitive words: Ages and essences
Pages 19-40  |  DOI:10.1007/BF01300125

Dorit Dor, Uri Zwick
Finding the αn-th largest element
Pages 41-58  |  DOI:10.1007/BF01300126

Nancy Eaton, Vojtěch Rödl
Graphs of small dimensions
Pages 59-85  |  DOI:10.1007/BF01300127

Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel
Difference sets and inverting the difference operator
Pages 87-106  |  DOI:10.1007/BF01300128

P. E. Haxell, Y. Kohayakawa, T. Luczak
Turán's extremal problem in random graphs: Forbidding odd cycles
Pages 107-122  |  DOI:10.1007/BF01300129

Chris Jagger, Pavel Šťovíček, Andrew Thomason
Multiplicities of subgraphs
Pages 123-141  |  DOI:10.1007/BF01300130

J. L. Ramírez-Alfonsín
Complexity of the Frobenius problem
Pages 143-147  |  DOI:10.1007/BF01300131

Volume 16, Issue 2, 1996

Ron Aharoni, Ron Holzman, Michael Krivelevich
On a theorem of lovász on covers inr-partite hypergraphs
Pages 149-174  |  DOI:10.1007/BF01844843

Louis J. Billera, A. Sarangarajan
All 0–1 polytopes are traveling salesman polytopes
Pages 175-188  |  DOI:10.1007/BF01844844

Collette R. Coullard, Lisa Hellerstein
Independence and port oracles for matroids, with an application to computational learning theory
Pages 189-208  |  DOI:10.1007/BF01844845

G. S. Gasparian
Minimal imperfect graphs: A simple approach
Pages 209-212  |  DOI:10.1007/BF01844846

Gyula Károlyi, Gábor Tardos
On point covers of multiple intervals and axis-parallel rectangles
Pages 213-222  |  DOI:10.1007/BF01844847

P. D. Seymour
Packing circuits in eulerian digraphs
Pages 223-231  |  DOI:10.1007/BF01844848

Zoltán Szigeti
On a matroid defined by ear-decompositions of graphs
Pages 233-241  |  DOI:10.1007/BF01844849

Michel Talagrand
How much are increasing sets positively correlated?
Pages 243-258  |  DOI:10.1007/BF01844850

Eberhard Triesch
On the recognition complexity of some graph properties
Pages 259-268  |  DOI:10.1007/BF01844851

Pavel Valtr
Lines, line-point incidences and crossing families in dense sets
Pages 269-294  |  DOI:10.1007/BF01844852

Van H. Vu
A strongly regularN-full graph of small order
Pages 295-299  |  DOI:10.1007/BF01844853

Volume 16, Issue 3, 1996

Noga Alon
Bipartite subgraphs
Pages 301-311  |  DOI:10.1007/BF01261315

Béla Bollobás, Andrew Thomason
Highly linked graphs
Pages 313-320  |  DOI:10.1007/BF01261316

Mihai Ciucu
A remark on sets having the Steinhaus property
Pages 321-324  |  DOI:10.1007/BF01261317

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vušković
Perfect matchings in balanced hypergraphs
Pages 325-329  |  DOI:10.1007/BF01261318

Guoli Ding
Bounding the number of circuits of a graph
Pages 331-341  |  DOI:10.1007/BF01261319

M. N. Ellingham, Luis Goddyn
List edge colourings of some 1-factorable multigraphs
Pages 343-352  |  DOI:10.1007/BF01261320

Andrew V. Goldberg, Alexander V. Karzanov
Path problems in skew-symmetric graphs
Pages 353-382  |  DOI:10.1007/BF01261321

Nabil Kahale, Leonard J. Schulman
Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
Pages 383-397  |  DOI:10.1007/BF01261322

János Kollár, Lajos Rónyai, Tibor Szabó
Norm-graphs and bipartite turán numbers
Pages 399-406  |  DOI:10.1007/BF01261323

Mekkia Kouider, Zbigniew Lonc
Covering cycles andk-term degree sums
Pages 407-412  |  DOI:10.1007/BF01261324

Vsevolod F. Lev
Representing powers of 2 by a sum of four integers
Pages 413-416  |  DOI:10.1007/BF01261325

René Peeters
Orthogonal representations over finite fields and the chromatic number of graphs
Pages 417-431  |  DOI:10.1007/BF01261326

Akira Saito
Fan-type theorem for path-connectivity
Pages 433-437  |  DOI:10.1007/BF01261327

Eckhard Steffen, Xuding Zhu
Star chromatic numbers of graphs
Pages 439-448  |  DOI:10.1007/BF01261328

Satoru Iwata
Principal structure of submodular systems and Hitchcock-type independent flows
Page 449  |  DOI:10.1007/BF01261329

Volume 16, Issue 4, 1996

László Babai
Paul Erdös 1913–1996
Pages 451-452  |  DOI:10.1007/BF01271264

Xiaotie Deng
Distributed near-optimal matching
Pages 453-464  |  DOI:10.1007/BF01271265

Jeff Kahn, Nathan Linial, Alex Samorodnitsky
Inclusion-exclusion: Exact and approximate
Pages 465-477  |  DOI:10.1007/BF01271266

H. A. Kierstead, K. Kolossa
On-line coloring of perfect graphs
Pages 479-491  |  DOI:10.1007/BF01271267

H. A. Kierstead, Yingxian Zhu
Classes of graphs that exclude a tree and a clique and are not vertex ramsey
Pages 493-504  |  DOI:10.1007/BF01271268

Maurice Pouzet, Norbert Sauer
Edge partitions of the Rado graph
Pages 505-520  |  DOI:10.1007/BF01271269

L. Pyber
Dense graphs and edge reconstruction
Pages 521-525  |  DOI:10.1007/BF01271270

L. Pyber, A. Shalev
Groups with super-exponential subgroup growth
Pages 527-533  |  DOI:10.1007/BF01271271

Bruce Reed, Neil Robertson, Paul Seymour, Robin Thomas
Packing directed circuits
Pages 535-554  |  DOI:10.1007/BF01271272

B. A. Reed, F. B. Shepherd
The gallai-younger conjecture for planar graphs
Pages 555-566  |  DOI:10.1007/BF01271273

Pavel Valtr
The probability thatn random points in a triangle are in convex position
Pages 567-573  |  DOI:10.1007/BF01271274

J. E. Yukich
Worst case asymptotics for some classical optimization problems
Pages 575-586  |  DOI:10.1007/BF01271275

Vsevolod F. Lev
Representation of elements of a sequence by sumsets
Pages 587-590  |  DOI:10.1007/BF01271276

Kazuo Murota
On exchange axioms for valuated matroids and valuated delta-matroids
Pages 591-596  |  DOI:10.1007/BF01271277

Volume 17, Issue 1, 1997

Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
Quasi-planar graphs have a linear number of edges
Pages 1-9  |  DOI:10.1007/BF01196127

Rudolf Ahlswede, Ning Cai
Shadows and isoperimetry under the sequence-subsequence relation
Pages 11-29  |  DOI:10.1007/BF01196128

Simeon Ball, Aart Blokhuis, Francesco Mazzocca
Maximal arcs in Desarguesian planes of odd order do not exist
Pages 31-41  |  DOI:10.1007/BF01196129

Dror Bar-Natan
Lie algebras and the Four Color Theorem
Pages 43-52  |  DOI:10.1007/BF01196130

Anders Björner, Siniša Vrećica
Onf-vectors and Betti numbers of multicomplexes
Pages 53-65  |  DOI:10.1007/BF01196131

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vušković
Universally signable graphs
Pages 67-77  |  DOI:10.1007/BF01196132

Uriel Feige
Randomized graph products, chromatic numbers, and the Lovász ϑ-function
Pages 79-90  |  DOI:10.1007/BF01196133

Howard Karloff, Yishay Mansour
On construction ofk-wise independent random variables
Pages 91-107  |  DOI:10.1007/BF01196134

János Komlós, Gábor N. Sárközy, Endre Szemerédi
Blow-up Lemma
Pages 109-123  |  DOI:10.1007/BF01196135

Andrew Thomason
Graph products and monochromatic multiplicities
Pages 125-134  |  DOI:10.1007/BF01196136

Huishan Zhou, Xuding Zhu
Multiplicativity of acyclic local tournaments
Pages 135-145  |  DOI:10.1007/BF01196137

Debe Bednarchak, Martin Helm
A note on the Beck-Fiala Theorem
Pages 147-149  |  DOI:10.1007/BF01196138

Volume 17, Issue 2, 1997

J. Eisfeld, K. Metsch
Blockings-dimensional subspaces by lines inPG(2s,q)
Pages 151-162  |  DOI:10.1007/BF01200904

Z. Füredi, P. Komjáth
Nonexistence of universal graphs without some trees
Pages 163-171  |  DOI:10.1007/BF01200905

Y. Kohayakawa, T. Łuczak, V. Rödl
OnK 4-free subgraphs of random graphs
Pages 173-213  |  DOI:10.1007/BF01200906

Nathan Linial, Michael Luby, Michael Saks, David Zuckerman
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Pages 215-234  |  DOI:10.1007/BF01200907

Bojan Mohar
Projective plane and Möbius band obstructions
Pages 235-266  |  DOI:10.1007/BF01200908

James Oxley
A matroid generalization of a result of Dirac
Pages 267-273  |  DOI:10.1007/BF01200909

Michel Talagrand
On boundaries and influences
Pages 275-285  |  DOI:10.1007/BF01200910

Gilles Zémor
An upper bound on the size of the snake-in-the-box
Pages 287-298  |  DOI:10.1007/BF01200911

R. Ahlswede, L. H. Khachatrian
Counterexample to the Frankl-Pach conjecture for uniform, dense families
Pages 299-301  |  DOI:10.1007/BF01200912

Volume 17, Issue 3, 1997

Noga Alon, Michael Krivelevich
The concentration of the chromatic number of random graphs
Pages 303-313  |  DOI:10.1007/BF01215914

William H. Cunningham, James F. Geelen
The optimal path-matching problem
Pages 315-337  |  DOI:10.1007/BF01215915

Tamás Fleiner
Covering a symmetric poset by symmetric chains
Pages 339-344  |  DOI:10.1007/BF01215916

Joachim von Zur Gathen, James R. Roche
Polynomials with two values
Pages 345-362  |  DOI:10.1007/BF01215917

A. Hajnal, P. Komjáth
A strongly non-Ramsey order type
Pages 363-367  |  DOI:10.1007/BF01215918

Jeff Kahn, P. Mark Kayll
On the stochastic independence properties of hard-core distributions
Pages 369-391  |  DOI:10.1007/BF01215919

János Komlós
Covering odd cycles
Pages 393-400  |  DOI:10.1007/BF01215920

Michael Krivelevich
On the minimal number of edges in color-critical graphs
Pages 401-426  |  DOI:10.1007/BF01215921

János Pach, Géza Tóth
Graphs drawn with few crossings per edge
Pages 427-439  |  DOI:10.1007/BF01215922

Volume 17, Issue 4, 1997

György Elekes
On linear combinatorics I. Concurrency—An algebraic approach
Pages 447-458  |  DOI:10.1007/BF01194999

Paul Erdős, András Gyárfás
A variant of the classical Ramsey problem
Pages 459-467  |  DOI:10.1007/BF01195000

Hugh Hind, Michael Molloy, Bruce Reed
Colouring a graph frugally
Pages 469-482  |  DOI:10.1007/BF01195001

Andrew Kotlov, László Lovász, Santosh Vempala
The Colin de Verdière number and sphere representations of a graph
Pages 483-521  |  DOI:10.1007/BF01195002

Thomas Müller
Finite group actions and asymptotic expansion ofe P(z)
Pages 523-554  |  DOI:10.1007/BF01195003

Yehuda Shalom
Expanding graphs and invariant means
Pages 555-575  |  DOI:10.1007/BF01195004

Miklós Simonovits, Vera T. Sós
Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
Pages 577-596  |  DOI:10.1007/BF01195005

Volume 18, Issue 1, January 1998

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan
Partitioning Graphs of Bounded Tree-Width
Pages 1-12  |  DOI:10.1007/s004930050001

György Elekes
On Linear Combinatorics II. Structure Theorems via Additive Number Theory
Pages 13-25  |  DOI:10.1007/PL00009806

Ehud Friedgut
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates
Pages 27-35  |  DOI:10.1007/PL00009809

Michel X. Goemans, David P. Williamson
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
Pages 37-59  |  DOI:10.1007/PL00009810

Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations
Pages 61-83  |  DOI:10.1007/PL00009811

Jeff Kahn, Yang Yu
Log-Concave Functions And Poset Probabilities
Pages 85-99  |  DOI:10.1007/PL00009812

Y. Kohayakawa, B. Kreuter, A. Steger
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
Pages 101-120  |  DOI:10.1007/PL00009804

Nathan Linial, Ori Sasson
Non-Expansive Hashing
Pages 121-132  |  DOI:10.1007/PL00009805

Pompeo Polito, Olga Polverino
On Small Blocking Sets
Pages 133-137  |  DOI:10.1007/PL00009807

Yonutz Stanchescu
On the Simplest Inverse Problem for Sums of Sets in Several Dimensions
Pages 139-149  |  DOI:10.1007/PL00009808

Volume 18, Issue 2, February 1998

Yossi Azar, Rajeev Motwani, Joseph (Seffi) Naor
Approximating Probability Distributions Using Small Sample Spaces
Pages 151-171  |  DOI:10.1007/PL00009813

Jason Fulman
The Combinatorics of Biased Riffle Shuffles
Pages 173-184  |  DOI:10.1007/PL00009814

Francisco Javier González Vieli
A Two-Spheres Problem on Homogeneous Trees
Pages 185-189  |  DOI:10.1007/PL00009815

Robert Jajcay
On a Construction of Infinite Families of Regular Cayley Maps
Pages 191-199  |  DOI:10.1007/PL00009816

Jeff Kahn, Jeong Han Kim
Random Matchings in Regular Graphs
Pages 201-226  |  DOI:10.1007/PL00009817

J. H. Koolen
The Distance-regular Graphs with Intersection Number and with an Eigenvalue
Pages 227-234  |  DOI:10.1007/PL00009818

A. V. Kostochka, V. Rödl
On Large Systems of Sets with No Large Weak Δ-subsystems
Pages 235-240  |  DOI:10.1007/PL00009819

Michael Molloy, Bruce Reed
A Bound on the Total Chromatic Number
Pages 241-280  |  DOI:10.1007/PL00009820

R. Pendavingh
On the Relation Between Two Minor-Monotone Graph Parameters
Pages 281-292  |  DOI:10.1007/PL00009821

Dhruv Mubayi
Note – Edge-Coloring Cliques with Three Colors on All 4-Cliques
Pages 293-296  |  DOI:10.1007/PL00009822

Raimund Seidel
Note – On the Number of Triangulations of Planar Point Sets
Pages 297-299  |  DOI:10.1007/PL00009823

Volume 18, Issue 3, March 1998

Noga Alon
The Shannon Capacity of a Union
Pages 301-310  |  DOI:10.1007/PL00009824

Andrew Beveridge, Alan Frieze, Colin McDiarmid
Random Minimum Length Spanning Trees in Regular Graphs
Pages 311-333  |  DOI:10.1007/PL00009825

Ilijas Farah
Approximate Homomorphisms
Pages 335-348  |  DOI:10.1007/PL00009826

Bernd Gärtner, Martin Henk, Günter M. Ziegler
Randomized Simplex Algorithms on Klee-Minty Cubes
Pages 349-372  |  DOI:10.1007/PL00009827

Y. Kohayakawa, H. J. Prömel, V. Rödl
Induced Ramsey Numbers
Pages 373-404  |  DOI:10.1007/PL00009828

W. Mader
Topological Subgraphs in Graphs of Large Girth
Pages 405-412  |  DOI:10.1007/PL00009829

M. Meszka, Z. Skupień
Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs
Pages 413-424  |  DOI:10.1007/PL00009830

Gerald W. Schuster
A Minimum Degree Result for Disjoint Cycles and Forests in Graphs
Pages 425-436  |  DOI:10.1007/PL00009831

Yugen Takegahara
On Butler's Unimodality Result
Pages 437-439  |  DOI:10.1007/PL00009832

Hong Wang
Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three
Pages 441-447  |  DOI:10.1007/PL00009833

Volume 18, Issue 4, April 1998

Yuri Bilu
Sum-Free Sets and Related Sets
Pages 449-459  |  DOI:10.1007/s004930050032

André Bouchet, W. H. Cunningham, J. F. Geelen
Principally Unimodular Skew-Symmetric Matrices
Pages 461-486  |  DOI:10.1007/s004930050033

Hikoe Enomoto
On the Existence of Disjoint Cycles in a Graph
Pages 487-492  |  DOI:10.1007/s004930050034

Paul Erdős, András Gyárfás, Miklós Ruszinkó
How to decrease the diameter of triangle-free graphs
Pages 493-501  |  DOI:10.1007/s004930050035

Greg N. Frederickson, Roberto Solis-Oba
Algorithms for Measuring Perturbability in Matroid Optimization
Pages 503-518  |  DOI:10.1007/s004930050036

Weidong Gao, Alfred Geroldinger
On the Structure of Zerofree Sequences
Pages 519-527  |  DOI:10.1007/s004930050037

Y. O. Hamidoune, A. S. Lladó, O. Serra
On Subsets with Small Product in Torsion-Free Groups
Pages 529-540  |  DOI:10.1007/s004930050038

Takayuki Hibi
The Comparability Graph of a Modular Lattice
Pages 541-548  |  DOI:10.1007/s004930050039

Alexander V. Karzanov
A Combinatorial Algorithm for the Minimum (2, r)-Metric Problem and Some Generalizations
Pages 549-568  |  DOI:10.1007/s004930050040

W. Mader
3n − 5 Edges Do Force a Subdivision of
Pages 569-595  |  DOI:10.1007/s004930050041

Volume 19, Issue 1, January 1999

Rudolf Ahlswede, Levon H. Khachatrian
A Pushing-Pulling Method: New Proofs of Intersection Theorems
Pages 1-15  |  DOI:10.1007/s004930050042

Yefim Dinitz, Naveen Garg, Michel X. Goemans
On the Single-Source Unsplittable Flow Problem
Pages 17-41  |  DOI:10.1007/s004930050043

György Elekes
On Linear Combinatorics III. Few Directions and Distorted Lattices
Pages 43-53  |  DOI:10.1007/s004930050044

Peter Frankl, Norihide Tokushige
The Erdős–Ko–Rado Theorem for Integer Sequences
Pages 55-63  |  DOI:10.1007/s004930050045

Stasys Jukna
Combinatorics of Monotone Computations
Pages 65-85  |  DOI:10.1007/s004930050046

Kazuo Murota
Submodular Flow Problem with a Nonseparable Cost Function
Pages 87-109  |  DOI:10.1007/s004930050047

János Pach, Joel Spencer
Uniformly Distributed Distances – a Geometric Application of Janson's Inequality
Pages 111-124  |  DOI:10.1007/s004930050048

Avi Wigderson, David Zuckerman
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications
Pages 125-138  |  DOI:10.1007/s004930050049

Xuding Zhu
Graphs Whose Circular Chromatic Number Equals the Chromatic Number
Pages 139-149  |  DOI:10.1007/s004930050050

Volume 19, Issue 2, February 1999

Marcelo H. Carvalho, Cláudio L. Lucchesi, U. S. R. Murty
Ear Decompositions of Matching Covered Graphs
Pages 151-174  |  DOI:10.1007/s004930050051

Alan Frieze, Ravi Kannan
Quick Approximation to Matrices and Applications
Pages 175-220  |  DOI:10.1007/s004930050052

David A. Grable
More-Than-Nearly-Perfect Packings and Partial Designs
Pages 221-239  |  DOI:10.1007/s004930050053

Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
The Linear-Array Conjecture in Communication Complexity Is False
Pages 241-254  |  DOI:10.1007/s004930050054

Svante Linusson
The Number of M-Sequences and f-Vectors
Pages 255-266  |  DOI:10.1007/s004930050055

Bruce R
Mangoes and Blueberries
Pages 267-296  |  DOI:10.1007/s004930050056

Friedrich Eisenbrand
NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron
Pages 297-300  |  DOI:10.1007/s004930050057

Volume 19, Issue 3, March 1999

László Babai, Anna Gál, Avi Wigderson
Superpolynomial Lower Bounds for Monotone Span Programs
Pages 301-319  |  DOI:10.1007/s004930050058

Sergei Evdokimov, Ilia Ponomarenko
Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks
Pages 321-333  |  DOI:10.1007/s004930050059

Oded Goldreich, Dana Ron
A Sublinear Bipartiteness Tester for Bounded Degree Graphs
Pages 335-373  |  DOI:10.1007/s004930050060

Tom Leighton, Bruce Maggs, Andréa W. Richa
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules
Pages 375-401  |  DOI:10.1007/s004930050061

Ran Raz, Pierre McKenzie
Separation of the Monotone NC Hierarchy
Pages 403-435  |  DOI:10.1007/s004930050062

Vojtech Rödl, Andrzej Ruciński
Perfect Matchings in ε-Regular Graphs and the Blow-Up Lemma
Pages 437-452  |  DOI:10.1007/s004930050063

Volume 19, Issue 4, October 1999

Noga Alon, Michael Krivelevich, Benny Sudakov
List Coloring of Random and Pseudo-Random Graphs
Pages 453-472  |  DOI:10.1007/s004939970001

B. Bollobás, A. D. Scott
Exact Bounds for Judicious Partitions of Graphs
Pages 473-486  |  DOI:10.1007/s004939970002

Tomas Feder, Pavol Hell, Jing Huang
List Homomorphisms and Circular Arc Graphs
Pages 487-505  |  DOI:10.1007/s004939970003

Martin Grohe
Equivalence in Finite-Variable Logics is Complete for Polynomial Time
Pages 507-532  |  DOI:10.1007/s004939970004

Dmitry N. Kozlov
Maximizing the Möbius Function of a Poset and the Sum of the Betti Numbers of the Order Complex
Pages 533-548  |  DOI:10.1007/s004939970005

L. Pyber
A Bound for the Diameter of Distance-Regular Graphs
Pages 549-553  |  DOI:10.1007/s004939970006

Jiří Sgall
Bounds on Pairs of Families with Restricted Intersections
Pages 555-566  |  DOI:10.1007/s004939970007

Van H. Vu
Extremal Set Systems with Weakly Restricted Intersections
Pages 567-587  |  DOI:10.1007/s004939970008

Soojin Cho
On the Support Size of Null Designs of Finite Ranked Posets
Pages 589-595  |  DOI:10.1007/s004939970009

Volume 20, Issue 1, January 2000

Béla Bajnok, Shahriar Shahriari
On Uniform f-vectors of Cutsets in the Truncated Boolean Lattice
Pages 1-14  |  DOI:10.1007/PL00009834

Michele Conforti, Bert Gerards, Ajai Kapoor
A Theorem of Truemper
Pages 15-26  |  DOI:10.1007/s004930070028

Péter L. Erdős, Ákos Seress, László A. Székely
Erdős–Ko–Rado and Hilton–Milner Type Theorems for Intersecting Chains in Posets
Pages 27-45  |  DOI:10.1007/s004930070029

Ilijas Farah
Approximate Homomorphisms II: Group Homomorphisms
Pages 47-60  |  DOI:10.1007/s004930070030

James F. Geelen
An Algebraic Matching Algorithm
Pages 61-70  |  DOI:10.1007/s004930070031

Vince Grolmusz
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs
Pages 71-86  |  DOI:10.1007/s004930070032

Jeannette Janssen, Kyriakos Kilakos
Adaptive Multicolouring
Pages 87-102  |  DOI:10.1007/s004930070033

Jiří Matoušek
On the Signed Domination in Graphs
Pages 103-108  |  DOI:10.1007/s004930070034

Erich Prisner
Bicliques in Graphs I: Bounds on Their Number
Pages 109-117  |  DOI:10.1007/s004930070035

Raphael Yuster
Decomposing Hypergraphs into Simple Hypertrees
Pages 119-140  |  DOI:10.1007/s004930070036

Tao Jiang, Dhruv Mubayi
NOTE New Upper Bounds for a Canonical Ramsey Problem
Pages 141-146  |  DOI:10.1007/s004930070037

Andrei Kotlov
NOTE Spectral Characterization of Tree-Width-Two Graphs
Pages 147-152  |  DOI:10.1007/s004930070038

Volume 20, Issue 2, February 2000

S. Bobkov, C. Houdré, P. Tetali
, Vertex Isoperimetry and Concentration
Pages 153-172  |  DOI:10.1007/s004930070018

Béla Bollobás, Andrew Thomason
The Structure of Hereditary Properties and Colourings of Random Graphs
Pages 173-202  |  DOI:10.1007/s004930070019

János Komlós
Tiling Turán Theorems
Pages 203-218  |  DOI:10.1007/s004930070020

Mekkia Kouider
Neighborhoods and Covering Vertices by Cycles
Pages 219-226  |  DOI:10.1007/s004930070021

János Körner, Gábor Simonyi
Graph Pairs and their Entropies: Modularity Problems
Pages 227-240  |  DOI:10.1007/s004930070022

Ran Raz
VC-Dimension of Sets of Permutations
Pages 241-255  |  DOI:10.1007/s004930070023

Vojtěch Rödl, Endre Szemerédi
On Size Ramsey Numbers of Graphs with Bounded Degree
Pages 257-262  |  DOI:10.1007/s004930070024

Joel Spencer, Gábor Tardos
Ups and Downs of First Order Sentences on Random Graphs
Pages 263-280  |  DOI:10.1007/s004930070025

István Talata
A Lower Bound for the Translative Kissing Numbers of Simplices
Pages 281-293  |  DOI:10.1007/s004930070026

Andrew Dabrowski, Lawrence S. Moss
NOTE The Johnson Graphs Satisfy a Distance Extension Property
Pages 295-300  |  DOI:10.1007/s004930070027

Volume 20, Issue 3, March 2000

Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron
Testing Monotonicity
Pages 301-337  |  DOI:10.1007/s004930070011

Jeff Kahn
A Normal Law for Matchings
Pages 339-391  |  DOI:10.1007/PL00009835

Sanjeev Khanna, Nathan Linial, Shmuel Safra
On the Hardness of Approximating the Chromatic Number
Pages 393-415  |  DOI:10.1007/s004930070013

Jeong Han Kim, Van H. Vu
Concentration of Multivariate Polynomials and Its Applications
Pages 417-434  |  DOI:10.1007/s004930070014

Kathie Cameron
NOTE – A Min-Max Relation for Monotone Path Systems in Simple Regions
Pages 435-440  |  DOI:10.1007/s004930070015

Dennis Eichhorn, Dhruv Mubayi
NOTE – Edge-Coloring Cliques with Many Colors on Subcliques
Pages 441-444  |  DOI:10.1007/s004930070016

Romeo Rizzi
NOTE – On Minimizing Symmetric Set Functions
Pages 445-450  |  DOI:10.1007/s004930070017

Volume 20, Issue 4, April 2000

Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
Efficient Testing of Large Graphs
Pages 451-476  |  DOI:10.1007/s004930070001

Małgorzata Bednarska, Tomasz Łuczak
Biased Positional Games for Which Random Strategies are Nearly Optimal
Pages 477-488  |  DOI:10.1007/s004930070002

Robin Forman
Morse Theory and Evasiveness
Pages 489-504  |  DOI:10.1007/s004930070003

Joel Friedman
On Cayley Graphs on the Symmetric Group Generated by Tranpositions
Pages 505-519  |  DOI:10.1007/s004930070004

A. V. Kostochka, M. Stiebitz
On the Number of Edges in Colour-Critical Graphs and Hypergraphs
Pages 521-530  |  DOI:10.1007/s004930070005

Benoit Larose, Claude Tardif
Hedetniemi's Conjecture and the Retracts of a Product of Graphs
Pages 531-544  |  DOI:10.1007/s004930070006

Nathan Linial, Alex Samorodnitsky, Avi Wigderson
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
Pages 545-568  |  DOI:10.1007/s004930070007

Lajos Rónyai
On a Conjecture of Kemnitz
Pages 569-573  |  DOI:10.1007/s004930070008

Alexander Schrijver
Total Dual Integrality of Matching Forest Constraints
Pages 575-588  |  DOI:10.1007/s004930070009

Géza Tóth
Finding Convex Sets in Convex Position
Pages 589-596  |  DOI:10.1007/s004930070010

Volume 21, Issue 1, January 2001

Ron Aharoni
Ryser's Conjecture for Tripartite 3-Graphs
Pages 1-4  |  DOI:10.1007/s004930170001

Richard Cole, Kirstin Ost, Stefan Schirra
Edge-Coloring Bipartite Multigraphs in O(E logD) Time
Pages 5-12  |  DOI:10.1007/s004930170002

P. E. Haxell, V. Rödl
Integer and Fractional Packings in Dense Graphs
Pages 13-38  |  DOI:10.1007/s004930170003

Kamal Jain
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
Pages 39-60  |  DOI:10.1007/s004930170004

László Lipták, László Lovász
Critical Facets of the Stable Set Polytope
Pages 61-88  |  DOI:10.1007/s004930170005

Roy Meshulam
The Clique Complex and Hypergraph Matching
Pages 89-94  |  DOI:10.1007/s004930170006

Friedhelm Meyer auf der Heide, Christian Scheideler
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
Pages 95-138  |  DOI:10.1007/s004930170007

Balázs Szegedy
Tilings of the Square With Similar Right Triangles
Pages 139-144  |  DOI:10.1007/s004930170008

Tamás Fleiner
Note – Uncrossing a Family of Set-Pairs
Pages 145-150  |  DOI:10.1007/s004930170009

Volume 21, Issue 2, April 2001

Noga Alon, János Pach, József Solymosi
Ramsey-type Theorems with Forbidden Subgraphs
Pages 155-170  |  DOI:10.1007/s004930100016

Tom Bohman, Alan Frieze, Miklós Ruszinkó, Lubos Thoma
Vertex Covers by Edge Disjoint Cliques
Pages 171-197  |  DOI:10.1007/s004930100017

R. L. Graham, V. Rödl, A. Ruciński
On Bipartite Graphs with Linear Ramsey Numbers
Pages 199-209  |  DOI:10.1007/s004930100018

Y. Katznelson
Chromatic Numbers of Cayley Graphs on Z and Recurrence
Pages 211-219  |  DOI:10.1007/s004930100019

Daniel J. Kleitman, András Gyárfás, Géza Tóth
Convex Sets in the Plane with Three of Every Four Meeting
Pages 221-232  |  DOI:10.1007/s004930100020

Péter Komjáth
Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems
Pages 233-238  |  DOI:10.1007/s004930100021

J. Korevaar
Tauberian Theorem of Erdős Revisited
Pages 239-250  |  DOI:10.1007/s004930100022

W. Mader
Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree and Large Girth
Pages 251-265  |  DOI:10.1007/s004930100023

Dieter Rautenbach, Bruce Reed
The Erdős–Pósa Property for Odd Cycles in Highly Connected Graphs
Pages 267-278  |  DOI:10.1007/s004930100024

Imre Z. Ruzsa
Additive Completion of Lacunary Sequences
Pages 279-291  |  DOI:10.1007/s004930100025

Norbert Sauer
Another Look at the Erdős–Hajnal–Pósa Results on Partitioning Edges of the Rado Graph
Pages 293-308  |  DOI:10.1007/s004930100026

Saharon Shelah
Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property
Pages 309-319  |  DOI:10.1007/s004930100027

Carsten Thomassen
The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity
Pages 321-333  |  DOI:10.1007/s004930100028

Volume 21, Issue 3, July 2001

Maria Axenovich, André Kündgen
On a Generalized Anti-Ramsey Problem
Pages 335-349  |  DOI:10.1007/s004930100000

Stanislav Jendrol', Ingo Schiermeyer
On a Max-min Problem Concerning Weights of Edges
Pages 351-359  |  DOI:10.1007/s004930100001

Odile Marcotte
Optimal Edge-Colourings for a Class of Planar Multigraphs
Pages 361-394  |  DOI:10.1007/s004930100002

Bojan Mohar
Existence of Polyhedral Embeddings of Graphs
Pages 395-401  |  DOI:10.1007/s004930100003

Oleg Pikhurko
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs
Pages 403-412  |  DOI:10.1007/s004930100004

Károly Podoski
Groups Covered by an Infinite Number of Abelian Subgroups
Pages 413-416  |  DOI:10.1007/s004930100005

Carsten Thomassen
Totally Odd -subdivisions in 4-chromatic Graphs
Pages 417-443  |  DOI:10.1007/s004930100006

Tamás Fleiner
The Size of 3-Cross-Free Families
Pages 445-448  |  DOI:10.1007/s004930100007

Gohar M. M. Kyureghyan
On a Degree Property of Cross-Intersecting Families
Pages 449-453  |  DOI:10.1007/s004930100008

Volume 21, Issue 4, October 2001

László Babai, Thomas P. Hayes, Peter G. Kimmel
The Cost of the Missing Bit: Communication Complexity with Help
Pages 455-488  |  DOI:10.1007/s004930100009

Christian Houdré
Mixed and Isoperimetric Estimates on the Log-Sobolev Constants of Graphs and Markov Chains
Pages 489-513  |  DOI:10.1007/s004930100010

Alexandr V. Kostochka, Douglas R. Woodall
Density Conditions for Panchromatic Colourings of Hypergraphs
Pages 515-541  |  DOI:10.1007/s004930100011

Monique Laurent
On the Sparsity Order of a Graph and Its Deficiency in Chordality
Pages 543-570  |  DOI:10.1007/s004930100012

Guglielmo Lunardon
Linear k-blocking Sets
Pages 571-581  |  DOI:10.1007/s004930100013

Roman Nedela, Martin Škoviera
Cayley Snarks and Almost Simple Groups
Pages 583-590  |  DOI:10.1007/s004930100014

Yonutz V. Stanchescu
An Upper Bound for d-dimensional Difference Sets
Pages 591-595  |  DOI:10.1007/s004930100015

Volume 22, Issue 1, January 2002

Alon Amit, Nathan Linial
Random Graph Coverings I: General Theory and Graph Connectivity
Pages 1-18  |  DOI:10.1007/s004930200000

Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vušković
Perfect Graphs, Partitionable Graphs and Cutsets
Pages 19-33  |  DOI:10.1007/s004930200001

Christian Delhommé, Norbert Sauer
Homomorphisms of Products of Graphs into Graphs Without Four Cycles
Pages 35-46  |  DOI:10.1007/s004930200002

András Frank, Zoltán Király
Graph Orientations with Edge-connection and Parity Constraints
Pages 47-70  |  DOI:10.1007/s004930200003

Mekkia Kouider, Maryvonne Mahéo
Connected [a,b]-factors in Graphs
Pages 71-82  |  DOI:10.1007/s004930200004

Erez Petrank, Gábor Tardos
On the Knowledge Complexity of
Pages 83-121  |  DOI:10.1007/s004930200005

Amnon Ta-Shma
Almost Optimal Dispersers
Pages 123-145  |  DOI:10.1007/s004930200006

Ya-Chen Chen, Z. Füredi
Hamiltonian Kneser Graphs
Pages 147-149  |  DOI:10.1007/s004930200007

Volume 22, Issue 2, April 2002

Krishnaswami Alladi, Alexander Berkovich
A Double Bounded Version of Schur's Partition Theorem
Pages 151-168  |  DOI:10.1007/s004930200008

József Beck
Positional Games and the Second Moment Method
Pages 169-216  |  DOI:10.1007/s004930200009

Fan Chung, Ronald Graham
Sparse Quasi-Random Graphs
Pages 217-244  |  DOI:10.1007/s004930200010

Peter J. Grabner, Peter Kirschenhofer, Robert F. Tichy
Combinatorial and Arithmetical Properties of Linear Numeration Systems
Pages 245-267  |  DOI:10.1007/s004930200011

András Gyárfás, Alice Hubenko, József Solymosi
Large Cliques in -Free Graphs
Pages 269-274  |  DOI:10.1007/s004930200012

Alexandr V. Kostochka
Transversals in Uniform Hypergraphs with Property (p,2)
Pages 275-285  |  DOI:10.1007/s004930200013

P. E. Haxell, T. Łuczak, P. W. Tingley
Ramsey Numbers for Trees of Small Maximum Degree
Pages 287-320  |  DOI:10.1007/s004930200014

Pavel Pudlák
Cycles of Nonzero Elements in Low Rank Matrices
Pages 321-334  |  DOI:10.1007/s004930200015

Volume 22, Issue 3, July 2002

Ron Aharoni, Eli Berger, Ran Ziv
A Tree Version of Kőnig's Theorem
Pages 335-343  |  DOI:10.1007/s004930200016

Michael Capalbo
Small Universal Graphs for Bounded-Degree Planar Graphs
Pages 345-359  |  DOI:10.1007/s004930200017

Uriel Feige, Christian Scheideler
Improved Bounds for Acyclic Job Shop Scheduling
Pages 361-399  |  DOI:10.1007/s004930200018

Martin Henk, Robert Weismantel
Diophantine Approximations and Integer Points of Cones
Pages 401-408  |  DOI:10.1007/s004930200019

Andreas Huck, Eberhard Triesch
Perfect Matchings in Balanced Hypergraphs – A Combinatorial Approach
Pages 409-416  |  DOI:10.1007/s004930200020

Chi-Jen Lu
Improved Pseudorandom Generators for Combinatorial Rectangles
Pages 417-434  |  DOI:10.1007/s004930200021

Aleksander Malnič, Dragan Marušič, Norbert Seifter, Boris Zgrablić
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z
Pages 435-443  |  DOI:10.1007/s004930200022

J. J. Montellano-Ballesteros, V. Neumann-Lara
An Anti-Ramsey Theorem
Pages 445-449  |  DOI:10.1007/s004930200023

Frantisek Franek
On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6
Pages 451-454  |  DOI:10.1007/s004930200024

Anna Galluccio, Luis A. Goddyn
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four
Pages 455-459  |  DOI:10.1007/s004930200025

Volume 22, Issue 4, October 2002

Uriel Feige, Oleg Verbitsky
Error Reduction by Parallel Repetition—A Negative Result
Pages 461-478  |  DOI:10.1007/s00493-002-0001-0

András Gyárfás
Transitive Edge Coloring of Graphs and Dimension of Lattices
Pages 479-496  |  DOI:10.1007/s00493-002-0002-z

Nathan Linial, Alex Samorodnitsky
Linear Codes and Character Sums
Pages 497-522  |  DOI:10.1007/s00493-002-0003-y

J. H. Boutet de Monvel, O. C. Martin
Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space
Pages 523-530  |  DOI:10.1007/s00493-002-0004-x

Jean François Maurras
From Membership to Separation, a Simple Construction
Pages 531-536  |  DOI:10.1007/s00493-002-0005-9

Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
Convex Embeddings and Bisections of 3-Connected Graphs1
Pages 537-554  |  DOI:10.1007/s00493-002-0006-8

Alexander Razborov, Avi Wigderson, Andrew Yao
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus
Pages 555-574  |  DOI:10.1007/s00493-002-0007-7

Zoltán Szigeti
Perfect Matchings Versus Odd Cuts
Pages 575-589  |  DOI:10.1007/s00493-002-0008-6

Carsten Thomassen
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree
Pages 591-596  |  DOI:10.1007/s00493-002-0009-5

Volume 23, Issue 1, January 2003

R. Ahlswede, H. Aydinian, L. Khachatrian
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace
Pages 5-22  |  DOI:10.1007/s00493-003-0011-6

Anders Björner, Mark de Longueville
Neighborhood Complexes of Stable Kneser Graphs
Pages 23-34  |  DOI:10.1007/s00493-003-0012-5

Béla Csaba, Ali Shokoufandeh, Endre Szemerédi
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three
Pages 35-72  |  DOI:10.1007/s00493-003-0013-4

Robert M. Guralnick, Aner Shalev
On the Spread of Finite Simple Groups
Pages 73-87  |  DOI:10.1007/s00493-003-0014-3

András Hajnal, Péter Komjáth
Some Remarks on the Simultaneous Chromatic Number
Pages 89-104  |  DOI:10.1007/s00493-003-0015-2

Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Pages 105-150  |  DOI:10.1007/s00493-003-0016-1

Pavel Valtr
Davenport–Schinzel Trees
Pages 151-184  |  DOI:10.1007/s00493-003-0017-0

Volume 23, Issue 2, April 2003

Guantao Chen, Ronald J. Gould, Xingxing Yu
Graph Connectivity After Path Removal
Pages 185-203  |  DOI:10.1007/s003-0018-z

I. Dinur, G. Kindler, R. Raz, S. Safra
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
Pages 205-243  |  DOI:10.1007/s00493-003-0019-y

Friedrich Eisenbrand, Andreas S. Schulz
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Pages 245-261  |  DOI:10.1007/s00493-003-0020-5

Kevin Ford
Maximal Collections of Intersecting Arithmetic Progressions
Pages 263-281  |  DOI:10.1007/s00493-003-0021-4

Grigor Gasparyan, Myriam Preissmann, András Sebő
Imperfect and Nonideal Clutters: A Common Approach
Pages 283-302  |  DOI:10.1007/s00493-003-0022-3

André E. Kézdy, Jenő Lehel, Robert C. Powers
Heavy Transversals and Indecomposable Hypergraphs
Pages 303-310  |  DOI:10.1007/s00493-003-0023-2

J. H. Kim, V. H. Vu
Small Complete Arcs in Projective Planes
Pages 311-363  |  DOI:10.1007/s00493-003-0024-1

Volume 23, Issue 3, July 2003

Sanjeev Arora, Madhu Sudan
Improved Low-Degree Testing and its Applications
Pages 365-426  |  DOI:10.1007/s00493-003-0025-0

Richard Ehrenborg, Harold Fox
Inequalities for cd-Indices of Joins and Products of Polytopes
Pages 427-452  |  DOI:10.1007/s00493-003-0026-z

Gašper Fijavž, Bojan Mohar
K 6-Minors in Projective Planar Graphs
Pages 453-465  |  DOI:10.1007/s00493-003-0027-y

Zhicheng Gao, Nicholas C. Wormald
Sharp Concentration of the Number of Submaps in Random Planar Triangulations
Pages 467-486  |  DOI:10.1007/s00493-003-0028-x

Yair Glasner
Ramanujan Graphs with Small Girth
Pages 487-502  |  DOI:10.1007/s00493-003-0029-9

Satoru Iwata, S. Thomas Mccormick, Maiko Shigeno
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow
Pages 503-525  |  DOI:10.1007/s00493-003-0030-3

Hunter S. Snevily
A Sharp Bound for the Number of Sets that Pairwise Intersect at k Positive Values
Pages 527-533  |  DOI:10.1007/s00493-003-0031-2

Volume 23, Issue 4, December 2003

Etsuko Bannai, Kazuki Kawasaki, Yusuke Nitamizu, Teppei Sato
An Upper Bound for the Cardinality of an s-Distance Set in Euclidean Space
Pages 535-557  |  DOI:10.1007/s00493-003-0032-1

Béla Bollobás, Imre Leader
Set Systems with few Disjoint Pairs
Pages 559-570  |  DOI:10.1007/s00493-003-0033-0

James D. Currie, Cameron W. Pierce
The Fixing Block Method in Combinatorics on Words
Pages 571-584  |  DOI:10.1007/s00493-003-0034-z

András Gács
On a Generalization of Rédei’s Theorem
Pages 585-598  |  DOI:10.1007/s00493-003-0035-y

W. Gao, Y. O. Hamidoune, A. Lladó, O. Serra
Covering a Finite Abelian Group by Subset Sums
Pages 599-611  |  DOI:10.1007/s00493-003-0036-x

Martin Grohe
Local Tree-Width, Excluded Minors, and Approximation Algorithms
Pages 613-632  |  DOI:10.1007/s00493-003-0037-9

Hein van der Holst
Two Tree-Width-Like Graph Invariants
Pages 633-651  |  DOI:10.1007/s00493-003-0038-8

Louis Kauffman, Robin Thomas
Temperely-Lieb Algebras and the Four-Color Theorem
Pages 653-667  |  DOI:10.1007/s00493-003-0039-7

Hanno Lefmann
On Heilbronn’s Problem in Higher Dimension
Pages 669-680  |  DOI:10.1007/s00493-003-0040-1

Zhi-Wei Sun
On the Function w(x)=|{1≤s≤k : x≡a s (mod n s )}|
Pages 681-691  |  DOI:10.1007/s00493-003-0041-0

Stephan Brandt
Note
Pages 693-696  |  DOI:10.1007/s00493-003-0042-z

Volume 24, Issue 1, January 2004

Tetsuya Abe
Sumsets Containing Powers of an Integer
Pages 1-4  |  DOI:10.1007/s00493-004-0001-3

Béla Bollobás, Oliver Riordan
The Diameter of a Scale-Free Random Graph
Pages 5-34  |  DOI:10.1007/s00493-004-0002-2

Anthony Bonato, Dejan Delić
On a Problem of Cameron’s on Inexhaustible Graphs
Pages 35-51  |  DOI:10.1007/s00493-004-0003-1

Jean-Marc Deshouillers, François Hennecart, Alain Plagne
On Small Sumsets in (ℤ/2ℤ) n
Pages 53-68  |  DOI:10.1007/s00493-004-0004-0

Reinhard Diestel, Daniela Kühn
On Infinite Cycles I
Pages 69-89  |  DOI:10.1007/s00493-004-0005-z

Reinhard Diestel, Daniela Kühn
On Infinite Cycles II
Pages 91-116  |  DOI:10.1007/s00493-004-0006-y

Benjamin Doerr
Linear Discrepancy of Totally Unimodular Matrices
Pages 117-125  |  DOI:10.1007/s00493-004-0007-x

Genghua Fan
Circular Chromatic Number and Mycielski Graphs
Pages 127-135  |  DOI:10.1007/s00493-004-0008-9

Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh Vazirani
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem
Pages 137-154  |  DOI:10.1007/s00493-004-0009-8

Daniela Kühn, Deryk Osthus
Every Graph of Sufficiently Large Average Degree Contains a C 4-Free Subgraph of Large Average Degree
Pages 155-162  |  DOI:10.1007/s00493-004-0010-2

Jiří Matoušek
A Combinatorial Proof of Kneser’s Conjecture
Pages 163-170  |  DOI:10.1007/s00493-004-0011-1

Volume 24, Issue 2, April 2004

Imre Bárány, Norihide Tokushige
The Minimum Area of Convex Lattice n-Gons
Pages 171-185  |  DOI:10.1007/s00493-004-0012-0

Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov
On the Value of a Random Minimum Weight Steiner Tree
Pages 187-207  |  DOI:10.1007/s00493-004-0013-z

C. A. Di Prisco, J. Llopis, S. Todorcevic
Parametrized Partitions of Products of Finite Sets
Pages 209-232  |  DOI:10.1007/s00493-004-0014-y

Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
Cuts, Trees and ℓ1-Embeddings of Graphs
Pages 233-269  |  DOI:10.1007/s00493-004-0015-x

Neil Hindman, Randall McCutcheon
Partition Theorems for Left and Right Variable Words
Pages 271-286  |  DOI:10.1007/s00493-004-0016-9

Daniela Kühn, Deryk Osthus
Induced Subdivisions In K s,s -Free Graphs of Large Average Degree
Pages 287-304  |  DOI:10.1007/s00493-004-0017-8

Uwe Leck
Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders
Pages 305-312  |  DOI:10.1007/s00493-004-0018-7

Dhruv Mubayi
An Explicit Construction for a Ramsey Problem
Pages 313-324  |  DOI:10.1007/s00493-004-0019-6

Ján Ninčák, Peter J. Owens
Note
Pages 325-329  |  DOI:10.1007/s00493-004-0020-0

Volume 24, Issue 3, July 2004

Jørgen Bang-Jensen, Anders Yeo
Decomposing k-ARc-Strong Tournaments Into Strong Spanning Subdigraphs
Pages 331-349  |  DOI:10.1007/s00493-004-0021-z

Christian Elsholtz
Lower Bounds For Multidimensional Zero Sums
Pages 351-358  |  DOI:10.1007/s00493-004-0022-y

C. Houdré, P. Tetali
Isoperimetric Invariants For Product Markov Chains and Graph Products
Pages 359-388  |  DOI:10.1007/s00493-004-0023-x

A. V. Kostochka, V. Rödl
On Graphs With Small Ramsey Numbers, II
Pages 389-401  |  DOI:10.1007/s00493-004-0024-9

Michael Krivelevich, Benni Sudakov, Tibor Szabó
Triangle Factors In Sparse Pseudo-Random Graphs
Pages 403-426  |  DOI:10.1007/s00493-004-0025-8

Bodo Lass
Matching Polynomials And Duality
Pages 427-440  |  DOI:10.1007/s00493-004-0026-7

W. Mader
High Connectivity Keeping Sets In n-Connected Graphs
Pages 441-458  |  DOI:10.1007/s00493-004-0027-6

Klaus Metsch
Blocking Subspaces By Lines In PG(n, q)
Pages 459-486  |  DOI:10.1007/s00493-004-0028-5

Patrice Ossona de Mendez, Pierre Rosenstiehl
Transitivity And Connectivity Of Permutations
Pages 487-501  |  DOI:10.1007/s00493-004-0029-4

Toniann Pitassi, Ran Raz
Regular Resolution Lower Bounds For The Weak Pigeonhole Principle
Pages 503-524  |  DOI:10.1007/s00493-004-0030-y

Michael Saks, Alex Samorodnitsky, Leonid Zosin
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks
Pages 525-530  |  DOI:10.1007/s00493-004-0031-x

Lutz Volkmann
The Maximum Size Of Graphs With A Uniquek- Factor
Pages 531-540  |  DOI:10.1007/s00493-004-0032-9

Volume 24, Issue 4, September 2004

Bernardo M. Ábrego, György Elekes, Silvia Fernández-Merchant
Structural Results For Planar Sets With Many Similar Subsets
Pages 541-554  |  DOI:10.1007/s00493-004-0033-8

R. Ahlswede, H. Aydinian, L. H. Khachatrian
On Shadows Of Intersecting Families
Pages 555-566  |  DOI:10.1007/s00493-004-0034-7

Richard Arratia, Béla Bollobás, Gregory B. Sorkin
A Two-Variable Interlace Polynomial
Pages 567-584  |  DOI:10.1007/s00493-004-0035-6

Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson
Near Optimal Separation Of Tree-Like And General Resolution
Pages 585-603  |  DOI:10.1007/s00493-004-0036-5

Jarosław Grytczuk, Andrzej P. Kisielewicz, Krzysztof Przesławski
Minimal Partitions Of A Box Into Boxes
Pages 605-614  |  DOI:10.1007/s00493-004-0037-4

Svante Janson, Andrzej Ruciński
The Deletion Method For Upper Tail Estimates
Pages 615-640  |  DOI:10.1007/s00493-004-0038-3

Rong Luo, Wenan Zang, Cun-Quan Zhang
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares
Pages 641-657  |  DOI:10.1007/s00493-004-0039-2

Roy Meshulam, Avi Wigderson
Expanders In Group Algebras
Pages 659-680  |  DOI:10.1007/s00493-004-0040-9

J. A. Thas, H. Van Maldeghem
Full Embeddings Of The Finite Dual Split Cayley Hexagons
Pages 681-698  |  DOI:10.1007/s00493-004-0041-8

Carsten Thomassen
The Locally Connected Compact Metric Spaces Embeddable In The Plane
Pages 699-718  |  DOI:10.1007/s00493-004-0042-7

Jacques Verstraëte
On The Number Of Sets Of Cycle Lengths
Pages 719-730  |  DOI:10.1007/s00493-004-0043-6

Sanming Zhou
Almost Covers Of 2-Arc Transitive Graphs
Pages 731-745  |  DOI:10.1007/s00493-004-0044-5

Volume 25, Issue 1, December 2004

Eli Berger
KKM—A Topological Approach For Trees
Pages 1-18  |  DOI:10.1007/s00493-005-0001-y

Christian Bey
Polynomial Lym Inequalities
Pages 19-38  |  DOI:10.1007/s00493-005-0002-x

Tom Bohman, Ron Holzman
Linear Versus Hereditary Discrepancy
Pages 39-47  |  DOI:10.1007/s00493-005-0003-9

Daniela Kühn, Deryk Osthus
Complete Minors In K s,s -Free Graphs
Pages 49-64  |  DOI:10.1007/s00493-005-0004-8

Bojan Mohar
Hajós Theorem For Colorings Of Edge-Weighted Graphs
Pages 65-76  |  DOI:10.1007/s00493-005-0005-7

Gábor N. Sárközy, Stanley Selkow
An Extension Of The Ruzsa-Szemerédi Theorem
Pages 77-84  |  DOI:10.1007/s00493-005-0006-6

Carsten Thomassen
Classification Of Locally 2-Connected Compact Metric Spaces
Pages 85-103  |  DOI:10.1007/s00493-005-0007-5

R. Ahlswede, L. H. Khachatrian
Katona’s Intersection Theorem: Four Proofs
Pages 105-110  |  DOI:10.1007/s00493-005-0008-4

Reinhard Diestel, Christof Rempel
Dense Minors In Graphs Of Large Girth
Pages 111-116  |  DOI:10.1007/s00493-005-0009-3

Bruce Reed, Benny Sudakov
List Colouring When The Chromatic Number Is Close To the Order Of The Graph
Pages 117-123  |  DOI:10.1007/s00493-005-0010-x

Volume 25, Issue 2, March 2005

Noga Alon, Vojtěch Rödl
Sharp Bounds For Some Multicolor Ramsey Numbers
Pages 125-141  |  DOI:10.1007/s00493-005-0011-9

Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul Seymour
Recognizing Berge Graphs
Pages 143-186  |  DOI:10.1007/s00493-005-0012-8

James Geelen, Satoru Iwata
Matroid Matching Via Mixed Skew-Symmetric Matrices
Pages 187-215  |  DOI:10.1007/s00493-005-0013-7

Joe Kilian, Charles Rackoff, Erez Petrank
Lower Bounds For Concurrent Zero Knowledge
Pages 217-249  |  DOI:10.1007/s00493-005-0014-6

Volume 25, Issue 3, May 2005

Joseph Cheriyan, Howard Karloff, Yuval Rabani
Approximating Directed Multicuts
Pages 251-269  |  DOI:10.1007/s00493-005-0015-5

Arjeh M. Cohen, Hans Cuypers, Ralf Gramlich
Local Recognition Of Non-Incident Point-Hyperplane Graphs
Pages 271-296  |  DOI:10.1007/s00493-005-0016-4

Alan Frieze, Nicholas C. Wormald
Random k-Sat: A Tight Threshold For Moderately Growing k
Pages 297-305  |  DOI:10.1007/s00493-005-0017-3

Ben Green
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs
Pages 307-326  |  DOI:10.1007/s00493-005-0018-2

Ken-ichi Kawarabayashi, Bjarne Toft
Any 7-Chromatic Graphs Has K 7 Or K 4,4 As A Minor
Pages 327-353  |  DOI:10.1007/s00493-005-0019-1

Radhika Ramamurthi, Douglas B. West
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem
Pages 355-366  |  DOI:10.1007/s00493-005-0020-8

Hong Wang
Maximal Total Length Of k Disjoint Cycles In Bipartite Graphs
Pages 367-377  |  DOI:10.1007/s00493-005-0021-7

Volume 25, Issue 4, July 2005

Michael Capalbo
Explicit Bounded-Degree Unique-Neighbor Concentrators
Pages 379-391  |  DOI:10.1007/s00493-005-0022-x

Guojun Li, Ying Xu, Chuanping Chen, Zhenhong Liu
On Connected [g,f +1]-Factors in Graphs
Pages 393-405  |  DOI:10.1007/s00493-005-0023-9

Nathan Linial, Eyal Rozenman
Random Lifts Of Graphs: Perfect Matchings
Pages 407-424  |  DOI:10.1007/s00493-005-0024-8

Wolfgang Mader
Graphs With 3n−6 Edges Not Containing A Subdivision Of K 5
Pages 425-438  |  DOI:10.1007/s00493-005-0025-7

Sean McGuinness
Bonds Intersecting Cycles In A Graph
Pages 439-450  |  DOI:10.1007/s00493-005-0026-6

Sean McGuinness
Circuits Through Cocircuits In A Graph With Extensions To Matroids
Pages 451-463  |  DOI:10.1007/s00493-005-0027-5

Leonard J. Schulman, Vijay V. Vazirani
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution
Pages 465-486  |  DOI:10.1007/s00493-005-0028-4

Benny Sudakov
A New Lower Bound For A Ramsey-Type Problem
Pages 487-498  |  DOI:10.1007/s00493-005-0029-3

Jeong Han Kim, Jiří Matoušek, Van H. Vu
Discrepancy After Adding A Single Set
Pages 499-501  |  DOI:10.1007/s00493-005-0030-x

Volume 25, Issue 5, September 2005

Richard Anstee, Attila Sali
Small Forbidden Configurations IV: The 3 Rowed Case
Pages 503-518  |  DOI:10.1007/s00493-005-0031-5

Irit Dinur, Oded Regev, Clifford Smyth
The Hardness of 3-Uniform Hypergraph Coloring
Pages 519-535  |  DOI:10.1007/s00493-005-0032-4

Ioana Dumitriu, Joel Spencer
The Liar Game Over an Arbitrary Channel
Pages 537-559  |  DOI:10.1007/s00493-005-0033-3

Peter Keevash, Benny Sudakov
The Turán Number Of The Fano Plane
Pages 561-574  |  DOI:10.1007/s00493-005-0034-2

Matthias Kriesell
Closed Separator Sets
Pages 575-598  |  DOI:10.1007/s00493-005-0035-1

Dhruv Mubayi, Jacques Verstraëte
Proof Of A Conjecture Of Erdős On Triangles In Set-Systems
Pages 599-614  |  DOI:10.1007/s00493-005-0036-0

Rom Pinchasi, Micha Sharir
On Graphs That Do Not Contain The Cube And Related Problems
Pages 615-623  |  DOI:10.1007/s00493-005-0037-z

Claude Tardif
The Fractional Chromatic Number Of The Categorical Product Of Graphs
Pages 625-632  |  DOI:10.1007/s00493-005-0038-y

Volume 25, Issue 6, December 2005

József Balogh, Béla Bollobás
Unavoidable Traces Of Set Systems
Pages 633-643  |  DOI:10.1007/s00493-005-0039-x

Itai Benjamini, Gady Kozma
A Resistance Bound Via An Isoperimetric Inequality
Pages 645-650  |  DOI:10.1007/s00493-005-0040-4

Stavros Garoufalidis, Martin Loebl
Random Walks And The Colored Jones Function
Pages 651-671  |  DOI:10.1007/s00493-005-0041-3

Peter Keevash, Benny Sudakov
On A Hypergraph Turán Problem Of Frankl
Pages 673-706  |  DOI:10.1007/s00493-005-0042-2

Elchanan Mossel, Yuval Peres
New Coins From Old: Computing With Unknown Bias
Pages 707-724  |  DOI:10.1007/s00493-005-0043-1

Joseph Samuel Myers, Andrew Thomason
The Extremal Function For Noncomplete Minors
Pages 725-753  |  DOI:10.1007/s00493-005-0044-0

Volume 26, Issue 1, February 2006

Noga Alon, Raphael Yuster
The Number Of Orientations Having No Fixed Tournament
Pages 1-16  |  DOI:10.1007/s00493-006-0001-6

Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs
Pages 17-36  |  DOI:10.1007/s00493-006-0002-5

Peter Frankl, Norihide Tokushige
Weighted Non-Trivial Multiply Intersecting Families
Pages 37-46  |  DOI:10.1007/s00493-006-0003-4

Robert Hochberg
Large Discrepancy In Homogenous Quasi-Arithmetic Progressions
Pages 47-64  |  DOI:10.1007/s00493-006-0004-3

Ákos Kisvölcsey
Flattening Antichains
Pages 65-82  |  DOI:10.1007/s00493-006-0005-2

Martin Kochol
Restrictions On Smallest Counterexamples To The 5-Flow Conjecture
Pages 83-89  |  DOI:10.1007/s00493-006-0006-1

Jiří Matoušek
The Number Of Unique-Sink Orientations of the Hypercube
Pages 91-99  |  DOI:10.1007/s00493-006-0007-0

Christos H. Papadimitriou, Santosh Vempala
On The Approximability Of The Traveling Salesman Problem
Pages 101-120  |  DOI:10.1007/s00493-006-0008-z

Volume 26, Issue 2, April 2006

Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen
Density Conditions For Triangles In Multipartite Graphs
Pages 121-131  |  DOI:10.1007/s00493-006-0009-y

Graham Brightwell, Jan van den Heuvel, Leen Stougie
A Linear Bound On The Diameter Of The Transportation Polytope
Pages 133-139  |  DOI:10.1007/s00493-006-0010-5

Michael R. Fellows, Jens Gramm, Rolf Niedermeier
On The Parameterized Intractability Of Motif Search Problems
Pages 141-167  |  DOI:10.1007/s00493-006-0011-4

Veselin Jungić, Daniel Král’, Riste Škrekovski
Colorings Of Plane Graphs With No Rainbow Faces
Pages 169-182  |  DOI:10.1007/s00493-006-0012-3

C. Laflamme, N. W. Sauer, V. Vuksanovic
Canonical Partitions Of Universal Structures
Pages 183-205  |  DOI:10.1007/s00493-006-0013-2

Seth Pettie
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification
Pages 207-230  |  DOI:10.1007/s00493-006-0014-1

N. W. Sauer
COLORING SUBGRAPHS OF THE RADO GRAPH
Pages 231-253  |  DOI:10.1007/s00493-006-0015-0

Volume 26, Issue 3, June 2006

Joseph Cheriyan, Santosh Vempala, Adrian Vetta
Network Design Via Iterative Rounding Of Setpair Relaxations
Pages 255-275  |  DOI:10.1007/s00493-006-0016-z

Dr. Matthias Kriesell
Mader’s Conjecture On Extremely Critical Graphs
Pages 277-314  |  DOI:10.1007/s00493-006-0017-y

Dhruv Mubayi, Vojtěch Rödl
Supersaturation For Ramsey-Turán Problems
Pages 315-332  |  DOI:10.1007/s00493-006-0018-x

Tibor Szabó, Gábor Tardos
Extremal Problems For Transversals In Graphs With Bounded Degree
Pages 333-351  |  DOI:10.1007/s00493-006-0019-9

Balázs Szegedy, Christian Szegedy
Symplectic Spaces And Ear-Decomposition Of Matroids
Pages 353-377  |  DOI:10.1007/s00493-006-0020-3

Volume 26, Issue 4, August 2006

Angela Aguglia, Gábor Korchmáros
Blocking Sets Of External Lines To A Conic In PG(2,q), q ODD
Pages 379-394  |  DOI:10.1007/s00493-006-0021-2

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube
Pages 395-410  |  DOI:10.1007/s00493-006-0022-1

Alexander Gamburd, Igor Pak
Expansion Of Product Replacement Graphs
Pages 411-429  |  DOI:10.1007/s00493-006-0023-0

C. D. Godsil, M. W. Newman
Independent Sets In Association Schemes
Pages 431-443  |  DOI:10.1007/s00493-006-0024-z

David J. Grynkiewicz
A Weighted Erdős-Ginzburg-Ziv Theorem
Pages 445-453  |  DOI:10.1007/s00493-006-0025-y

C. Houdré, T. Stoyanov
Expansion And Isoperimetric Constants For Product Graphs
Pages 455-473  |  DOI:10.1007/s00493-006-0026-x

Nathan Linial, Roy Meshulam
Homological Connectivity Of Random 2-Complexes
Pages 475-487  |  DOI:10.1007/s00493-006-0027-9

Tomasz Łuczak
On The Structure Of Triangle-Free Graphs Of Large Minimum Degree
Pages 489-493  |  DOI:10.1007/s00493-006-0028-8

Volume 26, Issue 5, October 2006

Yonatan Bilu, Nathan Linial
Lifts, Discrepancy and Nearly Optimal Spectral Gap
Pages 495-519  |  DOI:10.1007/s00493-006-0029-7

Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis Goddyn, Michael Lohman
Packing Non-Zero A-Paths In Group-Labelled Graphs
Pages 521-532  |  DOI:10.1007/s00493-006-0030-1

Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements
Pages 533-558  |  DOI:10.1007/s00493-006-0031-0

János Pach, Géza Tóth
How Many Ways Can One Draw A Graph?
Pages 559-576  |  DOI:10.1007/s00493-006-0032-z

Wesley Pegden
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs
Pages 577-585  |  DOI:10.1007/s00493-006-0033-y

Gábor Simonyi, Gábor Tardos
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings
Pages 587-626  |  DOI:10.1007/s00493-006-0034-x

Volume 26, Issue 6, December 2006

Noga Alon, Asaf Shapira
On An Extremal Hypergraph Problem Of Brown, Erdős And Sós
Pages 627-645  |  DOI:10.1007/s00493-006-0035-9

Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
Reducing The Seed Length In The Nisan-Wigderson Generator
Pages 647-681  |  DOI:10.1007/s00493-006-0036-8

J. H. Kim, V. H. Vu
Generating Random Regular Graphs
Pages 683-708  |  DOI:10.1007/s00493-006-0037-7

Joseph A. Thas, Koen Thas
Translation Generalized Quadrangles In Even Characteristic
Pages 709-732  |  DOI:10.1007/s00493-006-0038-6

Mark Jerrum
Two Remarks Concerning Balanced Matroids
Pages 733-742  |  DOI:10.1007/s00493-006-0039-5

Ian M. Wanless
Addendum To Schrijver's Work On Minimum Permanents
Pages 743-745  |  DOI:10.1007/s00493-006-0040-z

Volume 27, Issue 1, February 2007

Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed
Vertex-Colouring Edge-Weightings
Pages 1-12  |  DOI:10.1007/s00493-007-0041-6

Noga Alon, Eyal Lubetzky
Codes And Xor Graph Products
Pages 13-33  |  DOI:10.1007/s00493-007-0042-5

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-Color Ramsey Numbers For Paths
Pages 35-69  |  DOI:10.1007/s00493-007-0043-4

Lap Chi Lau
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Pages 71-90  |  DOI:10.1007/s00493-007-0044-3

Mikkel Thorup
Fully-Dynamic Min-Cut
Pages 91-127  |  DOI:10.1007/s00493-007-0045-2

Eric Jaligot
On Stabilizers Of Some Moieties Of The Random Tournament
Pages 129-133  |  DOI:10.1007/s00493-007-0046-1

Volume 27, Issue 2, March 2007

Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed
The Erdős–Pósa Property For Long Circuits
Pages 135-145  |  DOI:10.1007/s00493-007-0047-0

Péter L. Erdős, Lajos Soukup
How To Split Antichains In Infinite Posets
Pages 147-161  |  DOI:10.1007/s00493-007-0048-z

Dina Ghinelli, Dieter Jungnickel
A Non-Existence Result For Finite Projective Planes In Lenz-Barlotti Class I.4
Pages 163-166  |  DOI:10.1007/s00493-007-0049-y

Shuji Isobe, Xiao Zhou, Takao Nishizeki
Total Colorings Of Degenerate Graphs
Pages 167-182  |  DOI:10.1007/s00493-007-0050-5

Colin McDiarmid
On The Span Of A Random Channel Assignment Problem
Pages 183-203  |  DOI:10.1007/s00493-007-0051-4

Jiří Sgall, Gerhard J. Woeginger
An Approximation Scheme For Cake Division With A Linear Number Of Cuts
Pages 205-211  |  DOI:10.1007/s00493-007-0052-3

Amnon Ta-Shma, Christopher Umans, David Zuckerman
Lossless Condensers, Unbalanced Expanders, And Extractors
Pages 213-240  |  DOI:10.1007/s00493-007-0053-2

Carsten Thomassen
On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree
Pages 241-243  |  DOI:10.1007/s00493-007-0054-1

Hong-Jian Lai, Rui Xu, Cun-Quan Zhang
On Circular Flows Of Graphs
Pages 245-246  |  DOI:10.1007/s00493-007-0055-0

Gyula Pap
Packing Non-Returning A-Paths
Pages 247-251  |  DOI:10.1007/s00493-007-0056-z

Volume 27, Issue 3, May 2007

Henning Bruhn, Maya Stein
On end degrees and infinite cycles in locally finite graphs
  |  DOI:10.1007/s00493-007-2149-0

Ron Aharoni, Eli Berger, Ran Ziv
Independent systems of representatives in weighted graphs
Pages 253-267  |  DOI:10.1007/s00493-007-2086-y

Eldar Fischer, Ilan Newman
Testing of matrix-poset properties
Pages 293-327  |  DOI:10.1007/s00493-007-2154-3

S. Gerke, H. J. Prömel, T. Schickinger, A. Steger, A. Taraz
K 4-free subgraphs of random graphs revisited
Pages 329-365  |  DOI:10.1007/s00493-007-2010-5

Serkan Hoşten, Bernd Sturmfels
Computing the integer programming gap
Pages 367-382  |  DOI:10.1007/s00493-007-2057-3

Gyula Pap, László Szegő
Matchings of cycles and paths in directed graphs
Pages 383-398  |  DOI:10.1007/s00493-007-2131-x

Zsuzsanna Szaniszló, Zsolt Tuza
Lower bound on the profile of degree pairs in cross-intersecting set systems
Pages 399-405  |  DOI:10.1007/s00493-007-2105-z

Volume 27, Issue 4, July 2007

Ken-ichi Kawarabayashi, Zi-Xia Song
Some remarks on the odd hadwiger’s conjecture
  |  DOI:10.1007/s00493-007-2213-9

Richard N. Ball, Aleš Pultr, Petr Vojtěchovský
Colored graphs without colorful cycles
Pages 407-427  |  DOI:10.1007/s00493-007-2224-6

Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman
Complexity measures of sign matrices
Pages 439-463  |  DOI:10.1007/s00493-007-2160-5

Eran Nevo
On embeddability and stresses of graphs
Pages 465-472  |  DOI:10.1007/s00493-007-2168-x

Stéphan Thomassé, Anders Yeo
Total domination of graphs and small transversals of hypergraphs
Pages 473-487  |  DOI:10.1007/s00493-007-2020-3

Shawn Austin Walker
Multicover inequalities on colored complexes
Pages 489-501  |  DOI:10.1007/s00493-007-2198-4

Gábor Elek
Note on limits of finite graphs
Pages 503-507  |  DOI:10.1007/s00493-007-2214-8

Benny Sudakov
Note making a K 4-free graph bipartite
Pages 509-518  |  DOI:10.1007/s00493-007-2238-0

Volume 27, Issue 5, September 2007

Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan
Complete partitions of graphs
  |  DOI:10.1007/s00493-007-2169-9

Robert Krauthgamer, James R. Lee
The intrinsic dimensionality of graphs
Pages 551-585  |  DOI:10.1007/s00493-007-2183-y

Joel Spencer, Nicholas Wormald
Birth control for giants
Pages 587-628  |  DOI:10.1007/s00493-007-2163-2

Volume 27, Issue 6, November 2007

Noga Alon, Michael Krivelevich, Benny Sudakov
Embedding nearly-spanning bounded degree trees
Pages 629-644  |  DOI:10.1007/s00493-007-2182-z

Omer Angel, Itai Benjamini
A phase transition for the metric distortion of percolation on the hypercube
Pages 645-658  |  DOI:10.1007/s00493-007-2241-5

Stéphane Bessy, Stéphan Thomassé
Spanning a strong digraph by α circuits: A proof of Gallai’s conjecture
Pages 659-667  |  DOI:10.1007/s00493-007-2073-3

Péter Csorba
Homotopy types of box complexes
Pages 669-682  |  DOI:10.1007/s00493-007-2204-x

Angelos Georgakopoulos
Connected but not path-connected subspaces of infinite graphs
Pages 683-698  |  DOI:10.1007/s00493-007-2188-6

Anna de Mier
k-noncrossing and k-nonnesting graphs and fillings of ferrers diagrams
Pages 699-720  |  DOI:10.1007/s00493-007-2297-2

Van H. Vu
Spectral norm of random matrices
Pages 721-736  |  DOI:10.1007/s00493-007-2190-z

Noga Alon, Eyal Lubetzky
Privileged users in zero-error transmission over a noisy channel
Pages 737-743  |  DOI:10.1007/s00493-007-2263-z

Sanming Zhou
Almost covers of 2-arc transitive graphs
Pages 745-746  |  DOI:10.1007/s00493-007-2369-3

Volume 28, Issue 1, January 2008

Satoru Iwata, Takuro Matsuda
Finding coherent cyclic orders in strong digraphs
  |  DOI:10.1007/s00493-008-2305-1

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
The stable set polytope of quasi-line graphs
  |  DOI:10.1007/s00493-008-2244-x

Maria Chudnovsky, Paul Seymour, Blair Sullivan
Cycles in dense digraphs
Pages 1-18  |  DOI:10.1007/s00493-008-2331-z

Erik D. Demaine, Mohammadtaghi Hajiaghayi
Linearity of grid minors in treewidth with applications through bidimensionality
Pages 19-36  |  DOI:10.1007/s00493-008-2140-4

Ori Einstein
Properties of intersecting families of ordered sets
Pages 37-44  |  DOI:10.1007/s00493-008-2201-8

Jacob E. Goodman, Richard Pollack
The combinatorial encoding of disjoint convex sets in the plane
Pages 69-81  |  DOI:10.1007/s00493-008-2239-7

Serguei Norine
Pfaffian graphs, T-joins and crossing numbers
Pages 89-98  |  DOI:10.1007/s00493-008-2150-2

Serguei Norine, Robin Thomas
Pfaffian labelings and signs of edge colorings
Pages 99-111  |  DOI:10.1007/s00493-008-2231-2

József Solymosi, Van H. Vu
Near optimal bounds for the Erdős distinct distances problem in high dimensions
Pages 113-125  |  DOI:10.1007/s00493-008-2099-1

Rom Pinchasi
Geometric graphs with no two parallel edges
Pages 127-130  |  DOI:10.1007/s00493-008-2250-z

Volume 28, Issue 2, March 2008

Pierre Charbit, András Sebő
Cyclic orders: Equivalence and duality
  |  DOI:10.1007/s00493-008-2197-0

Maria Chudnovsky, William H. Cunningham, Jim Geelen
An algorithm for packing non-zero A-paths in group-labelled graphs
Pages 145-161  |  DOI:10.1007/s00493-008-2157-8

Assaf Naor, Jacques Verstraëte
Parity check matrices and product representations of squares
Pages 163-185  |  DOI:10.1007/s00493-008-2195-2

Oleg Pikhurko
An exact Turán result for the generalized triangle
Pages 187-208  |  DOI:10.1007/s00493-008-2187-2

Siddhartha Sahi
Higher correlation inequalities
Pages 209-227  |  DOI:10.1007/s00493-008-2249-5

Vojtěch Rödl, Endre Szemerédi, Andrzej Ruciński
An approximate Dirac-type theorem for k-uniform hypergraphs
Pages 229-260  |  DOI:10.1007/s00493-008-2295-z

Volume 28, Issue 3, May 2008

Noga Alon, Asaf Shapira
A separation theorem in property testing
Pages 261-281  |  DOI:10.1007/s00493-008-2321-1

Jonah Blasiak
The toric ideal of a graphic matroid is generated by quadrics
Pages 283-297  |  DOI:10.1007/s00493-008-2256-6

Michael I. Hartley
An exploration of locally projective polytopes
Pages 299-314  |  DOI:10.1007/s00493-008-2230-3

Jürgen Herzog, Satoshi Murai, Xinxian Zheng, Takayuki Hibi, Ngô Viêt Trung
Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
Pages 315-323  |  DOI:10.1007/s00493-008-2319-8

Daniel Král’, Robin Thomas
Coloring even-faced graphs in the torus and the Klein bottle
Pages 325-341  |  DOI:10.1007/s00493-008-2315-z

Yonutz V. Stanchescu
Three-dimensional sets with small sumset
Pages 343-355  |  DOI:10.1007/s00493-008-2205-4

Benny Sudakov, Jacques Verstraëte
Cycle lengths in sparse graphs
Pages 357-372  |  DOI:10.1007/s00493-008-2300-6

Peter Dukes, Alan C. H. Ling
Note edge-colourings of K n,n with no long two-coloured cycles
Pages 373-378  |  DOI:10.1007/s00493-008-2272-6

Volume 28, Issue 4, July 2008

Yahya O. Hamidoune, Oriol Serra, Gilles Zémor
On the critical pair theory in abelian groups: Beyond Chowla’s Theorem
  |  DOI:10.1007/s00493-008-2262-8

Jorge L. Arocha, Javier Bracho, Luis Montejano
A colorful theorem on transversal lines to plane convex sets
  |  DOI:10.1007/s00493-008-2385-y

Robert Brignall, Sophie Huczynska, Vincent Vatter
Decomposing simple permutations, with enumerative consequences
Pages 385-400  |  DOI:10.1007/s00493-008-2314-0

Javier Cilleruelo, Melvyn B. Nathanson
Perfect difference sets constructed from Sidon sets
Pages 401-414  |  DOI:10.1007/s00493-008-2339-4

Ariel Gabizon, Ran Raz
Deterministic extractors for affine sources over large fields
Pages 415-440  |  DOI:10.1007/s00493-008-2259-3

Hemanshu Kaul, Alexandr Kostochka, Gexin Yu
On a graph packing conjecture by Bollobás, Eldridge and Catlin
Pages 469-485  |  DOI:10.1007/s00493-008-2278-0

Dragomir Ž. Đoković
Hadamard matrices of order 764 exist
Pages 487-489  |  DOI:10.1007/s00493-008-2384-z

Vsevolod F. Lev
The rectifiability threshold in abelian groups
Pages 491-497  |  DOI:10.1007/s00493-008-2299-8

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-color Ramsey numbers for paths
Pages 499-502  |  DOI:10.1007/s00493-008-2395-9

Volume 28, Issue 5, September 2008

Carsten Thomassen, Antoine Vella
Graph-like continua, augmenting arcs, and Menger’s theorem
  |  DOI:10.1007/s00493-008-2342-9

Tobias Müller
Two-point concentration in random geometric graphs
  |  DOI:10.1007/s00493-008-2283-3

Ehud Friedgut
On the measure of intersecting families, uniqueness and stability
Pages 503-528  |  DOI:10.1007/s00493-008-2318-9

Terence Tao
Product set estimates for non-commutative groups
Pages 547-594  |  DOI:10.1007/s00493-008-2271-7

Volume 28, Issue 6, November 2008

David P. Bunde, Kevin Milans, Douglas B. West, Hehui Wu
Optimal strong parity edge-coloring of complete graphs
Pages 625-632  |  DOI:10.1007/s00493-008-2364-3

Andreas F. Holmsen, János Pach, Helge Tverberg
Points surrounding the origin
Pages 633-644  |  DOI:10.1007/s00493-008-2427-5

Bill Jackson, Tibor Jordán
On the rigidity of molecular graphs
Pages 645-658  |  DOI:10.1007/s00493-008-2287-z

Jean A. Larson
Counting canonical partitions in the random graph
Pages 659-678  |  DOI:10.1007/s00493-008-2148-9

Márton Makai, Jácint Szabó
The parity problem of polymatroids without double circuits
Pages 679-692  |  DOI:10.1007/s00493-008-2374-1

Michael Molloy
When does the giant component bring unsatisfiability?
Pages 693-734  |  DOI:10.1007/s00493-008-2123-5

Asaf Shapira
Quasi-randomness and the distribution of copies of a fixed graph
Pages 735-745  |  DOI:10.1007/s00493-008-2375-0

Volume 29, Issue 1, January 2009

John Bamberg, Maska Law, Tim Penttila
Tight sets and m-ovoids of generalised quadrangles
Pages 1-17  |  DOI:10.1007/s00493-009-2179-x

Massimo Giulietti
Line partitions of internal points to a conic in PG(2,q)
Pages 19-25  |  DOI:10.1007/s00493-009-2225-8

Marek Janata, Jácint Szabó
The superstar packing problem
Pages 27-48  |  DOI:10.1007/s00493-009-1986-4

H. A. Kierstead, Goran Konjevod
Coloring number and on-line Ramsey theory for graphs and hypergraphs
Pages 49-64  |  DOI:10.1007/s00493-009-2264-1

Daniela Kühn, Deryk Osthus
The minimum degree threshold for perfect graph packings
Pages 65-107  |  DOI:10.1007/s00493-009-2254-3

Serguei Norine
Drawing 4-Pfaffian graphs on the torus
Pages 109-119  |  DOI:10.1007/s00493-009-2354-0

Werner Schwärzler
On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
Pages 121-126  |  DOI:10.1007/s00493-009-2407-4

Masao Tsugaki
A note on a spanning 3-tree
Pages 127-129  |  DOI:10.1007/s00493-009-2349-x

Volume 29, Issue 2, March 2009

Béla Bollobás, Boris Pittel
The distribution of the root degree of a random permutation
Pages 131-151  |  DOI:10.1007/s00493-009-2343-3

Jacob Fox, Benny Sudakov
Density theorems for bipartite graphs and related Ramsey-type results
Pages 153-196  |  DOI:10.1007/s00493-009-2475-5

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
Arc-disjoint in-trees in directed graphs
Pages 197-214  |  DOI:10.1007/s00493-009-2428-z

Ken-Ichi Kawarabayashi, Bruce Reed
Highly parity linked graphs
Pages 215-225  |  DOI:10.1007/s00493-009-2178-y

Vladimir Nikiforov, Cecil C. Rousseau
Ramsey goodness and beyond
Pages 227-262  |  DOI:10.1007/s00493-009-2409-2

Volume 29, Issue 3, May 2009

Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs
Pages 263-297  |  DOI:10.1007/s00493-009-2356-y

Bill Cuckler, Jeff Kahn
Hamiltonian cycles in Dirac graphs
Pages 299-326  |  DOI:10.1007/s00493-009-2360-2

Bill Cuckler, Jeff Kahn
Entropy bounds for perfect matchings and Hamiltonian cycles
Pages 327-335  |  DOI:10.1007/s00493-009-2366-9

Hein van der Holst, Rudi Pendavingh
On a graph property generalizing planarity and flatness
Pages 337-361  |  DOI:10.1007/s00493-009-2219-6

Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis
On the Fourier spectrum of symmetric Boolean functions
Pages 363-387  |  DOI:10.1007/s00493-009-2310-z

Volume 29, Issue 4, July 2009

Noga Alon, Eyal Lubetzky
Uniformly cross intersecting families
Pages 389-431  |  DOI:10.1007/s00493-009-2332-6

Anton Dochtermann
The universality of Hom complexes of graphs
Pages 433-448  |  DOI:10.1007/s00493-009-2376-7

Attila Pór, David R. Wood
Colourings of the cartesian product of graphs and multiplicative Sidon sets
Pages 449-466  |  DOI:10.1007/s00493-009-2257-0

Vojtěch Rödl, Mathias Schacht
Generalizations of the removal lemma
Pages 467-501  |  DOI:10.1007/s00493-009-2320-x

John P. Steinberger
Tilings of the integers can have superpolynomial periods
Pages 503-509  |  DOI:10.1007/s00493-009-2269-9

Volume 29, Issue 5, September 2009

Simeon Ball, Oriol Serra
Punctured combinatorial Nullstellensätze
Pages 511-522  |  DOI:10.1007/s00493-009-2509-z

Saugata Basu, Richard Pollack, Marie-Françoise Roy
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
Pages 523-546  |  DOI:10.1007/s00493-009-2357-x

Dan Hefetz, Michael Krivelevich, Tibor Szabó
Hamilton cycles in highly connected and expanding graphs
Pages 547-568  |  DOI:10.1007/s00493-009-2362-0

Beukje Temmermans, Joseph A. Thas, Hendrik Van Maldeghem
On collineations and dualities of finite generalized polygons
Pages 569-594  |  DOI:10.1007/s00493-009-2435-0

Baogang Xu, Xingxing Yu
On a bipartition problem of Bollobás and Scott
Pages 595-618  |  DOI:10.1007/s00493-009-2381-x

Tamás Király, Jácint Szabó
A note on parity constrained orientations
Pages 619-628  |  DOI:10.1007/s00493-009-2411-8

Volume 29, Issue 6, November 2009

Mei-Chu Chang
Explicit sum-product theorems for large subsets of \( \mathbb{F} \) p
Pages 629-635  |  DOI:10.1007/s00493-009-2424-3

Gary L. Ebert, Giuseppe Marino, Olga Polverino, Rocco Trombetti
Infinite families of new semifields
Pages 637-663  |  DOI:10.1007/s00493-009-2406-5

Babak Farzad, Michael Molloy
On the edge-density of 4-critical graphs
Pages 665-689  |  DOI:10.1007/s00493-009-2267-y

Komei Fukuda, Sonoko Moriyama, Hiroki Nakayama, Jürgen Richter-Gebert
Every non-Euclidean oriented matroid admits a biquadratic final polynomial
Pages 691-698  |  DOI:10.1007/s00493-009-2255-2

Vít Jelínek, Jan Kynčl, Rudolf Stolař, Tomáš Valla
Monochromatic triangles in two-colored plane
Pages 699-718  |  DOI:10.1007/s00493-009-2291-y

Emanuele Viola, Avi Wigderson
One-way multiparty communication lower bound for pointer jumping with applications
Pages 719-743  |  DOI:10.1007/s00493-009-2667-z

Volume 30, Issue 1, January 2010

Ada Chan, Chris Godsil
Type-II matrices and combinatorial structures
Pages 1-24  |  DOI:10.1007/s00493-010-2329-1

Stefaan De Winter, Jeroen Schillewaert
Characterizations of finite classical polar spaces by intersection numbers with hyperplanes and spaces of codimension 2
Pages 25-45  |  DOI:10.1007/s00493-010-2441-2

Venkatesan Guruswami, James R. Lee, Alexander Razborov
Almost Euclidean subspaces of ℓ 1 N VIA expander codes
Pages 47-68  |  DOI:10.1007/s00493-010-2463-9

Bill Jackson
An inequality for Tutte polynomials
Pages 69-81  |  DOI:10.1007/s00493-010-2484-4

Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer
Partition properties of the dense local order and a colored version of Milliken’s theorem
Pages 83-104  |  DOI:10.1007/s00493-010-2445-y

Martin Marciniszyn, Reto Spöhel
Online vertex-coloring games in random graphs
Pages 105-123  |  DOI:10.1007/s00493-010-2436-z

Volume 30, Issue 2, March 2010

Péter Csikvári
On a poset of trees
Pages 125-137  |  DOI:10.1007/s00493-010-2516-0

Cécile Dartyge, András Sárközy, Mihály Szalay
On the pseudo-randomness of subsets related to primitive roots
Pages 139-162  |  DOI:10.1007/s00493-010-2534-y

Katalin Gyarmati, Máté Matolcsi, Imre Z. Ruzsa
A superadditivity and submultiplicativity property for cardinalities of sumsets
Pages 163-174  |  DOI:10.1007/s00493-010-2413-6

Peter Keevash, Dhruv Mubayi
Set systems without a simplex or a cluster
Pages 175-200  |  DOI:10.1007/s00493-010-2401-x

Henry A. Kierstead, Alexandr V. Kostochka
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture
Pages 201-216  |  DOI:10.1007/s00493-010-2420-7

Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz
A fast algorithm for equitable coloring
Pages 217-224  |  DOI:10.1007/s00493-010-2483-5

H. Van Vu
Structure of large incomplete sets in abelian groups
Pages 225-237  |  DOI:10.1007/s00493-010-2336-2

Raphael Yuster
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Pages 239-246  |  DOI:10.1007/s00493-010-2496-0

Satoru Fujishige
A note on disjoint arborescences
Pages 247-252  |  DOI:10.1007/s00493-010-2518-y

Guo-Niu Han
New hook length formulas for binary trees
Pages 253-256  |  DOI:10.1007/s00493-010-2503-5

Volume 30, Issue 3, May 2010

Ronnie Barequet, Gill Barequet, Günter Rote
Formulae and growth rates of high-dimensional polycubes
Pages 257-275  |  DOI:10.1007/s00493-010-2448-8

Tom Bohman, Alan Frieze, Dhruv Mubayi, Oleg Pikhurko
Hypergraphs with independent neighborhoods
Pages 277-293  |  DOI:10.1007/s00493-010-2474-6

Hiroshi Hirai
Metric packing for K 3+K 3
Pages 295-326  |  DOI:10.1007/s00493-010-2447-9

Ryan O’Donnell, Rocco A. Servedio
New degree bounds for polynomial threshold functions
Pages 327-358  |  DOI:10.1007/s00493-010-2173-3

Volume 30, Issue 4, July 2010

George Androulakis, Stephen J. Dilworth, Nigel J. Kalton
A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces
Pages 359-385  |  DOI:10.1007/s00493-010-2507-1

Maria Chudnovsky, Paul Seymour
The three-in-a-tree problem
Pages 387-417  |  DOI:10.1007/s00493-010-2334-4

Shawn Hedman, Wai Yan Pong
Locally finite homogeneous graphs
Pages 419-434  |  DOI:10.1007/s00493-010-2472-8

Ernest E. Shult, Koen Thas
A theorem of Cohen on parapolar spaces
Pages 435-444  |  DOI:10.1007/s00493-010-2410-9

Benny Sudakov, Jan Vondrák
A randomized embedding algorithm for trees
Pages 445-470  |  DOI:10.1007/s00493-010-2422-5

Rade T. Živaljević
Oriented matroids and Ky Fan’s theorem
Pages 471-484  |  DOI:10.1007/s00493-010-2446-x

Volume 30, Issue 5, September 2010

Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
Pages 485-520  |  DOI:10.1007/s00493-010-2455-9

Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
Every rayless graph has an unfriendly partition
Pages 521-532  |  DOI:10.1007/s00493-010-2590-3

Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar
Approximation algorithms via contraction decomposition
Pages 533-552  |  DOI:10.1007/s00493-010-2341-5

Gábor Elek
On the limit of large girth graph sequences
Pages 553-563  |  DOI:10.1007/s00493-010-2559-2

Shinya Fujita, Ken-ichi Kawarabayashi
Non-separating even cycles in highly connected graphs
Pages 565-580  |  DOI:10.1007/s00493-010-2482-6

Manor Mendel, Assaf Naor
Maximum gradient embeddings and monotone clustering
Pages 581-615  |  DOI:10.1007/s00493-010-2302-z

Volume 30, Issue 6, November 2010

Reinhard Diestel, Philipp Sprüssel
The homology of a locally finite graph with ends
  |  DOI:10.1007/s00493-010-2481-7

E. Rodney Canfield, Brendan D. McKay
Asymptotic enumeration of integer matrices with large equal row and column sums
  |  DOI:10.1007/s00493-010-2426-1

Peter Adams, Elizabeth J. Billington, D. G. Hoffman, C. C. Lindner
The generalized almost resolvable cycle system problem
  |  DOI:10.1007/s00493-010-2525-z

Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger
On properties of random dissections and triangulations
Pages 627-654  |  DOI:10.1007/s00493-010-2464-8

Ken-ichi Kawarabayashi, Yusuke Kobayashi
Algorithms for finding an induced cycle in planar graphs
Pages 715-734  |  DOI:10.1007/s00493-010-2499-x

Torsten Korneffel, Eberhard Triesch
An asymptotic bound for the complexity of monotone graph properties
Pages 735-743  |  DOI:10.1007/s00493-010-2485-3

Volume 31, Issue 1, January 2011

David Brink
Chevalley’s theorem with restricted variables
  |  DOI:10.1007/s00493-011-2504-z

Paul Wollan
Packing cycles with modularity constraints
  |  DOI:10.1007/s00493-011-2551-5

Edward Marchant, Andrew Thomason
The structure of hereditary properties and 2-coloured multigraphs
  |  DOI:10.1007/s00493-011-2630-7

Hongze Li, Hao Pan
Monochromatic integers adding to polynomials of prime variables
  |  DOI:10.1007/s00493-011-2531-9

Molly Dunkum, Peter Hamburger, Attila Pór
Destroying cycles in digraphs
  |  DOI:10.1007/s00493-011-2589-4

Andrzej Dudek, Vojtěch Rödl
On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers
  |  DOI:10.1007/s00493-011-2626-3

Eli Berger, Henning Bruhn
Eulerian edge sets in locally finite graphs
  |  DOI:10.1007/s00493-011-2572-0

Richard P. Anstee, Balin Fleming
Linear algebra methods for forbidden configurations
  |  DOI:10.1007/s00493-011-2595-6

Volume 31, Issue 2, March 2011

Amir Yehudayoff
Affine extractors over prime fields
  |  DOI:10.1007/s00493-011-2604-9

Saharon Shelah, Jindřich Zapletal
Ramsey theorems for product of finite sets with submeasures
  |  DOI:10.1007/s00493-011-2677-5

Erika R. Kovács, László A. Végh
The constructive characterization of (κ,ℓ)-edge-connected digraphs
  |  DOI:10.1007/s00493-011-2570-2

Pierre Gillibert, Friedrich Wehrung
An infinite combinatorial statement with a poset parameter
  |  DOI:10.1007/s00493-011-2602-y

Domingos Dellamonica Jr., Vojtěch Rödl
Hereditary quasirandom properties of hypergraphs
  |  DOI:10.1007/s00493-011-2621-8

Anders Björner
A q-analogue of the FKG inequality and some applications
  |  DOI:10.1007/s00493-011-2644-1

József Balogh, Wojciech Samotij
The number of K m,m -free graphs
  |  DOI:10.1007/s00493-011-2610-y

Volume 31, Issue 3, May 2011

Simeon Ball, Oriol Serra
Erratum to: Punctured Combinatorial Nullstellensätze
  |  DOI:10.1007/s00493-011-2837-7

R. Bruce Richter, Brendan Rooney, Carsten Thomassen
On planarity of compact, locally connected, metric spaces
  |  DOI:10.1007/s00493-011-2563-1

Zohar S. Karnin, Amir Shpilka
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
  |  DOI:10.1007/s00493-011-2537-3

Alexander Engström
A local criterion for Tverberg graphs
  |  DOI:10.1007/s00493-011-2665-9

Zeev Dvir, Amir Shpilka
Towards dimension expanders over finite fields
  |  DOI:10.1007/s00493-011-2540-8

Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans
Binary subtrees with few labeled paths
  |  DOI:10.1007/s00493-011-2634-3

Daniela Amato, John K. Truss
Some constructions of highly arc-transitive digraphs
  |  DOI:10.1007/s00493-011-2523-9

Volume 31, Issue 4, November 2011

Shahar Dobzinski, Noam Nisan
Limitations of VCG-based mechanisms
Pages 379-396  |  DOI:10.1007/s00493-011-2528-4

Bertrand Guenin, Robin Thomas
Packing directed circuits exactly
Pages 397-421  |  DOI:10.1007/s00493-011-1687-5

Colin Mcdiarmid, Tobias Müller
On the chromatic number of random geometric graphs
Pages 423-488  |  DOI:10.1007/s00493-011-2403-3

Ákos Seress, Tsai-Lien Wong, Xuding Zhu
Distinguishing labeling of the actions of almost simple groups
Pages 489-506  |  DOI:10.1007/s00493-011-2221-7

Volume 31, Issue 5, November 2011

Darryn Bryant, Melinda Buchanan, Daniel Horsley, Barbara Maenhaut
On the non-existence of pair covering designs with at least as many points as blocks
Pages 507-528  |  DOI:10.1007/s00493-011-2639-y

Svante Janson
Poset limits and exchangeable random posets
Pages 529-563  |  DOI:10.1007/s00493-011-2591-x

Paweł Prałat, Jacques Verstraëte, Nicholas Wormald
On the threshold for k-regular subgraphs of random graphs
Pages 565-581  |  DOI:10.1007/s00493-011-2545-3

Alexander A. Sherstov
The unbounded-error communication complexity of symmetric functions
Pages 583-614  |  DOI:10.1007/s00493-011-2580-0

Joseph A. Thas, Hendrik Van Maldeghem
Generalized Veronesean embeddings of projective spaces
Pages 615-629  |  DOI:10.1007/s00493-011-2651-2

Volume 31, Issue 6, December 2011

Jørgen Bang-Jensen, Matthias Kriesell
On the problem of finding disjoint cycles and dicycles in a digraph
Pages 639-668  |  DOI:10.1007/s00493-011-2670-z

Jonathan Browder, Isabella Novik
Face numbers of generalized balanced Cohen-Macaulay complexes
Pages 669-689  |  DOI:10.1007/s00493-011-2675-7

Yong-Gao Chen, Jin-Hui Fang
On a problem of Cilleruelo and Nathanson
Pages 691-696  |  DOI:10.1007/s00493-011-2682-8

Jin-Hui Fang
A characterization of the identity function with equation f(p+q+r)=f(p)+f(q)+f(r)
Pages 697-701  |  DOI:10.1007/s00493-011-2739-8

Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
Pages 703-723  |  DOI:10.1007/s00493-011-2655-y

Hiroshi Nozaki
Inside S-inner product sets and Euclidean designs
Pages 725-737  |  DOI:10.1007/s00493-011-2661-0

Tamás Terpai
Proof of a conjecture of V. Nikiforov
Pages 739-754  |  DOI:10.1007/s00493-011-2652-1

Volume 32, Issue 1, January 2012

Omer Angel, Abraham D. Flaxman, David B. Wilson
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
Pages 1-33  |  DOI:10.1007/s00493-012-2552-z

Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah
Monotonicity testing and shortest-path routing on the cube
Pages 35-53  |  DOI:10.1007/s00493-012-2765-1

Dustin Cartwright, Melody Chan
Three notions of tropical rank for symmetric matrices
Pages 55-84  |  DOI:10.1007/s00493-012-2701-4

Eryk Kopczyński, Igor Pak, Piotr Przytycki
Acute triangulations of polyhedra and ℝ N
Pages 85-110  |  DOI:10.1007/s00493-012-2691-2

A. M. Raigorodskii
On the chromatic numbers of spheres in ℝ n
Pages 111-123  |  DOI:10.1007/s00493-012-2709-9

Volume 32, Issue 2, March 2012

Paul Balister, Béla Bollobás
Projections, entropy and sumsets
Pages 125-141  |  DOI:10.1007/s00493-012-2453-1

József Balogh, Dhruv Mubayi
Almost all triangle-free triple systems are tripartite
Pages 143-169  |  DOI:10.1007/s00493-012-2657-4

David Conlon
On the Ramsey multiplicity of complete graphs
Pages 171-186  |  DOI:10.1007/s00493-012-2465-x

Ervin Győri, Nathan Lemons
3-uniform hypergraphs avoiding a given odd cycle
Pages 187-203  |  DOI:10.1007/s00493-012-2584-4

Hao Huang, Benny Sudakov
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Pages 205-219  |  DOI:10.1007/s00493-012-2746-4

Marcus Isaksson, Guy Kindler, Elchanan Mossel
The geometry of manipulation — A quantitative proof of the Gibbard-Satterthwaite theorem
Pages 221-250  |  DOI:10.1007/s00493-012-2704-1

Volume 32, Issue 3, April 2012

Maria Chudnovsky, Paul Seymour
Packing seagulls
Pages 251-282  |  DOI:10.1007/s00493-012-2594-2

Maria Chudnovsky, Sang-Il Oum, Paul Seymour
Finding minimum clique capacity
Pages 283-287  |  DOI:10.1007/s00493-012-2891-9

Fedor V. Fomin, Yngve Villanger
Treewidth computation and extremal combinatorics
Pages 289-308  |  DOI:10.1007/s00493-012-2536-z

Jan-Christoph Schlage-Puchta
Applications of character estimates to statistical problems for the symmetric group
Pages 309-323  |  DOI:10.1007/s00493-012-2502-9

Saharon Shelah
Universality among graphs omitting a complete bipartite graph
Pages 325-362  |  DOI:10.1007/s00493-012-2033-4

Terence Tao, Van Vu
The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
Pages 363-372  |  DOI:10.1007/s00493-012-2716-x

Volume 32, Issue 4, April 2012

Attila Bernáth, Tamás Király
A unifying approach to splitting-off
Pages 373-401  |  DOI:10.1007/s00493-012-2548-8

Maria Chudnovsky, Paul Seymour
Perfect matchings in planar cubic graphs
Pages 403-424  |  DOI:10.1007/s00493-012-2660-9

Péter Csikvári, Katalin Gyarmati, András Sárközy
Density and ramsey type results on algebraic equations with restricted solution sets
Pages 425-449  |  DOI:10.1007/s00493-012-2697-9

John Haslegrave
The Bollobás-Thomason conjecture for 3-uniform hypergraphs
Pages 451-471  |  DOI:10.1007/s00493-012-2696-x

János Pach, Gábor Tardos, József Solymosi
Remarks on a Ramsey theory for trees
Pages 473-482  |  DOI:10.1007/s00493-012-2763-3

Florian Pfender
Complete subgraphs in multipartite graphs
Pages 483-495  |  DOI:10.1007/s00493-012-2425-5

Volume 32, Issue 5, May 2012

Javier Cilleruelo
Combinatorial problems in finite fields and Sidon sets
Pages 497-511  |  DOI:10.1007/s00493-012-2819-4

David Conlon, Jacob Fox, Benny Sudakov
On two problems in graph Ramsey theory
Pages 513-535  |  DOI:10.1007/s00493-012-2710-3

György Elekes, Endre Szabó
How to find groups? (and how to use them in Erdős geometry?)
Pages 537-571  |  DOI:10.1007/s00493-012-2505-6

Heidi Gebauer
Disproof of the neighborhood conjecture with implications to SAT
Pages 573-587  |  DOI:10.1007/s00493-012-2679-y

Géza Kós, Lajos Rónyai
Alon’s Nullstellensatz for multisets
Pages 589-605  |  DOI:10.1007/s00493-012-2758-0

Shachar Lovett
Equivalence of polynomial conjectures in additive combinatorics
Pages 607-618  |  DOI:10.1007/s00493-012-2714-z

Volume 32, Issue 6, December 2012

Jacob Fox, Po-Shen Loh
On a problem of Erdös and Rothschild on edges in triangles
Pages 619-628  |  DOI:10.1007/s00493-012-2844-3

Nick Gravin, Sinai Robins, Dmitry Shiryaev
Translational tilings by a polytope, with multiplicity
Pages 629-649  |  DOI:10.1007/s00493-012-2860-3

Matthias Hamann, Julian Pott
Transitivity conditions in infinite graphs
Pages 649-688  |  DOI:10.1007/s00493-012-2694-z

Roman N. Karasev
Analogues of the central point theorem for families with d-intersection property in ℝ d
Pages 689-702  |  DOI:10.1007/s00493-012-2603-5

Tamás Király, Lap Chi Lau, Mohit Singh
Degree bounded matroids and submodular flows
Pages 703-720  |  DOI:10.1007/s00493-012-2760-6

Giorgis Petridis
New proofs of Plünnecke-type estimates for product sets in groups
Pages 721-733  |  DOI:10.1007/s00493-012-2818-5

Hajime Tanaka
The Erdös-Ko-Rado theorem for twisted Grassmann graphs
Pages 735-740  |  DOI:10.1007/s00493-012-2798-5

Volume 33, Issue 1, February 2013

Alexander Barvinok
A bound for the number of vertices of a polytope with applications
Pages 1-10  |  DOI:10.1007/s00493-013-2870-9

Joshua Browning, Douglas S. Stones, Ian M. Wanless
Bounds on the number of autotopisms and subsquares of a Latin square
Pages 11-22  |  DOI:10.1007/s00493-013-2809-1

Jakub Jasiński
Ramsey degrees of boron tree structures
Pages 23-44  |  DOI:10.1007/s00493-013-2723-6

Nathan Keller, Guy Kindler
Quantitative relation between noise sensitivity and influences
Pages 45-71  |  DOI:10.1007/s00493-013-2719-2

Alexander A. Sherstov
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Pages 73-96  |  DOI:10.1007/s00493-013-2759-7

Carsten Thomassen
Decomposing graphs into paths of fixed length
Pages 97-123  |  DOI:10.1007/s00493-013-2633-7

Volume 33, Issue 2, April 2013

Peter Allen, Graham Brightwell, Jozef Skokan
Ramsey-goodness—and otherwise
Pages 125-160  |  DOI:10.1007/s00493-013-2778-4

David K. Butler
A characterisation of the planes meeting a non-singular quadric of PG(4,Q) in a conic
Pages 161-179  |  DOI:10.1007/s00493-013-2402-7

Jacob Fox, Choongbum Lee, Benny Sudakov
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
Pages 181-197  |  DOI:10.1007/s00493-013-2853-x

Dániel Gerbner
Profile polytopes of some classes of families
Pages 199-216  |  DOI:10.1007/s00493-013-2917-y

Yahya Ould Hamidoune
Two inverse results
Pages 217-230  |  DOI:10.1007/s00493-013-2731-6

Stephen Huggett, Iain Moffatt
Bipartite partial duals and circuits in medial graphs
Pages 231-252  |  DOI:10.1007/s00493-013-2850-0

Volume 33, Issue 3, June 2013

Omid Amini, Louis Esperet, Jan Van Den Heuvel
A unified approach to distance-two colouring of graphs on surfaces
Pages 253-296  |  DOI:10.1007/s00493-013-2573-2

Christine Bachoc, Arnaud Pêcher, Alain Thiéry
On the theta number of powers of cycle graphs
Pages 297-317  |  DOI:10.1007/s00493-013-2950-x

Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
Circumference, chromatic number and online coloring
Pages 319-334  |  DOI:10.1007/s00493-013-2542-9

Gábor Kun
Constraints, MMSNP and expander relational structures
Pages 335-347  |  DOI:10.1007/s00493-013-2405-4

James R. Lee, Anastasios Sidiropoulos
Pathwidth, trees, and random embeddings
Pages 349-374  |  DOI:10.1007/s00493-013-2685-8

Volume 33, Issue 4, August 2013

Antonio Avilées, Stevo Todorcevic
Finite basis for analytic strong n-gaps
Pages 375-393  |  DOI:10.1007/s00493-013-2773-9

Eoin Long
Long paths and cycles in subgraphs of the cube
Pages 395-428  |  DOI:10.1007/s00493-013-2736-1

Jens Marklof, Andreas Strömbergsson
Diameters of random circulant graphs
Pages 429-466  |  DOI:10.1007/s00493-013-2820-6

Bojan Mohar, Gábor Simonyi, Gábor Tardos
Local chromatic number of quadrangulations of surfaces
Pages 467-494  |  DOI:10.1007/s00493-013-2771-y

Wesley Pegden
Critical graphs without triangles: An optimum density construction
Pages 495-512  |  DOI:10.1007/s00493-013-2440-1

Volume 33, Issue 5, October 2013

Zdeněk Dvořák, Bojan Mohar
Chromatic number and complete graph substructures for degree sequences
Pages 513-529  |  DOI:10.1007/s00493-013-2649-z

Viktor Harangi
On the density of triangles and squares in regular finite and unimodular random graphs
Pages 531-548  |  DOI:10.1007/s00493-013-2907-0

Naonori Kakimura, Ken-Ichi Kawarabayashi
Half-integral packing of odd cycles through prescribed vertices
Pages 549-572  |  DOI:10.1007/s00493-013-2865-6

Dragan Mašulović
Some classes of finite homomorphism-homogeneous point-line geometries
Pages 573-590  |  DOI:10.1007/s00493-013-2583-0

Dhruv Mubayi
Counting substructures II: Hypergraphs
Pages 591-612  |  DOI:10.1007/s00493-013-2638-2

Carsten Schultz
Paths of homomorphisms from stable Kneser graphs
Pages 613-621  |  DOI:10.1007/s00493-013-2749-9

Guy Wolfovitz
K 4-free graphs without large induced triangle-free subgraphs
Pages 623-631  |  DOI:10.1007/s00493-013-2845-x

Volume 33, Issue 6, December 2013

Laurent Beaudou, Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan
Lines in hypergraphs
Pages 633-654  |  DOI:10.1007/s00493-013-2910-5

Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers
Sorting under partial information (without the ellipsoid algorithm)
Pages 655-697  |  DOI:10.1007/s00493-013-2821-5

Peter Keevash, Benny Sudakov, Jacques Verstraëte
On a conjecture of Erdős and Simonovits: Even cycles
Pages 699-732  |  DOI:10.1007/s00493-013-2863-8

Romanos-Diogenes Malikiosis
Lattice-point enumerators of ellipsoids
Pages 733-744  |  DOI:10.1007/s00493-013-2943-9

Volume 34, Issue 1, February 2014

Aart Blokhuis, Andries E. Brouwer, Çiçek Güven
Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
Pages 1-10  |  DOI:10.1007/s00493-014-2779-y

Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein
Connectivity and tree structure in finite graphs
Pages 11-46  |  DOI:10.1007/s00493-014-2898-5

Yoshimi Egawa, Kenta Ozeki
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
Pages 47-60  |  DOI:10.1007/s00493-014-2576-7

Edita Máčajová, Martin Škoviera
Sparsely intersecting perfect matchings in cubic graphs
Pages 61-94  |  DOI:10.1007/s00493-014-2550-4

Zeev Nutov
Approximating minimum-cost edge-covers of crossing biset-families
Pages 95-114  |  DOI:10.1007/s00493-014-2773-4

Jin-Xin Zhou, Yan-Quan Feng
Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order 2P
Pages 115-128  |  DOI:10.1007/s00493-014-2834-8

Volume 34, Issue 2, April 2014

M. Amin Bahmanian
Connected Baranyai’s theorem
Pages 129-138  |  DOI:10.1007/s00493-014-2928-3

Yair Glasner
Strong approximation in random towers of graphs
Pages 139-172  |  DOI:10.1007/s00493-014-2620-7

Parikshit Gopalan
Constructing Ramsey graphs from Boolean function representations
Pages 173-206  |  DOI:10.1007/s00493-014-2367-1

Roi Krakovski
Topological minors in line graphs — A proof of Zha’s conjecture
Pages 207-252  |  DOI:10.1007/s00493-014-2721-3

R. Bruce Richter, Brendan Rooney, Carsten Thomassen
Erratum to: Commentary for “On planarity of compact, locally connected, metric spaces”
Pages 253-254  |  DOI:10.1007/s00493-014-2967-9

Volume 34, Issue 3, June 2014

Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova
Steiner transitive-closure spanners of low-dimensional posets
Pages 255-277  |  DOI:10.1007/s00493-014-2833-9

Matt Devos, Zdeněk Dvořák, Jacob Fox, Jessica McDonald, Bojan Mohar
A minimum degree condition forcing complete graph immersion
Pages 279-298  |  DOI:10.1007/s00493-014-2806-z

Zoltán Füredi, Tao Jiang, Robert Seiver
Exact solution of the hypergraph Turán problem for k-uniform linear paths
Pages 299-322  |  DOI:10.1007/s00493-014-2838-4

Alexandr Kostochka, Matthew Yancey
Ore’s conjecture for k=4 and Grötzsch’s Theorem
Pages 323-329  |  DOI:10.1007/s00493-014-3020-x

Cédric Lecouvey
Plünnecke and Kneser type theorems for dimension estimates
Pages 331-358  |  DOI:10.1007/s00493-014-2874-0

Amir Shpilka, Avishay Tal
On the minimal fourier degree of symmetric Boolean functions
Pages 359-377  |  DOI:10.1007/s00493-014-2875-z

Volume 34, Issue 4, August 2014

Elad Aigner-Horev, Hiệp Hàn, Mathias Schacht
Extremal results for odd cycles in sparse pseudorandom graphs
Pages 379-406  |  DOI:10.1007/s00493-014-2912-y

Xavier Dahan
Regular graphs of large girth and arbitrary degree
Pages 407-426  |  DOI:10.1007/s00493-014-2897-6

Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros
Measurable events indexed by products of trees
Pages 427-470  |  DOI:10.1007/s00493-014-2880-2

Nathan Linial, Zur Luria
An upper bound on the number of high-dimensional permutations
Pages 471-486  |  DOI:10.1007/s00493-011-2842-8

Andrew Suk
Coloring intersection graphs of x-monotone curves in the plane
Pages 487-505  |  DOI:10.1007/s00493-014-2942-5

Volume 34, Issue 5, October 2014

József Balogh, János Barát, Dániel Gerbner, András Gyárfás
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
Pages 507-526  |  DOI:10.1007/s00493-014-2935-4

Simon R. Blackburn, Thomas A. McCourt
Triangulations of the sphere, bitrades and abelian groups
Pages 527-546  |  DOI:10.1007/s00493-014-2924-7

Stephan Brandt, Janina Müttel, Dieter Rautenbach
The circumference of the square of a connected graph
Pages 547-559  |  DOI:10.1007/s00493-014-2899-4

John Haslegrave
Judicious partitions of uniform hypergraphs
Pages 561-572  |  DOI:10.1007/s00493-014-2916-7

Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus
Optimal covers with Hamilton cycles in random graphs
Pages 573-596  |  DOI:10.1007/s00493-014-2956-z

András Sebő, Jens Vygen
Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
Pages 597-629  |  DOI:10.1007/s00493-014-2960-3

Volume 34, Issue 6, December 2014

Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan
Lower bounds for boxicity
Pages 631-655  |  DOI:10.1007/s00493-011-2981-0

Éric Balandraud, Benjamin Girard
A nullstellensatz for sequences over \(\mathbb{F}_p \)
Pages 657-688  |  DOI:10.1007/s00493-011-2961-4

Mike Bennett, Alex Iosevich, Jonathan Pakianathan
Three-point configurations determined by subsets of \(\mathbb{F}_q^2\) via the Elekes-Sharir Paradigm
Pages 689-706  |  DOI:10.1007/s00493-014-2978-6

Thilo V. Weinert
Idiosynchromatic Poetry
Pages 707-742  |  DOI:10.1007/s00493-011-2980-1

Volume 35, Issue 1, February 2015

Bartłomiej Bosek, Tomasz Krawczyk
A subexponential upper bound for the on-line chain partitioning problem
Pages 1-38  |  DOI:10.1007/s00493-014-2908-7

Adrian Dumitrescu, Csaba D. Tóth
Packing anchored rectangles
Pages 39-61  |  DOI:10.1007/s00493-015-3006-1

Gábor Korchmáros, Gábor P. Nagy, Nicola Pace
k-nets embedded in a projective plane over a field
Pages 63-74  |  DOI:10.1007/s00493-011-3055-z

Asaf Shapira, Benny Sudakov
Small complete minors above the extremal edge density
Pages 75-94  |  DOI:10.1007/s00493-015-3013-2

Csaba D. Tóth
The Szemerédi-Trotter theorem in the complex plane
Pages 95-126  |  DOI:10.1007/s00493-014-2686-2

Volume 35, Issue 2, April 2015

Miklós Abért, Tamás Hubai
Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
Pages 127-151  |  DOI:10.1007/s00493-014-3066-7

Nathan Bowler, Johannes Carmesin
Matroid intersection, base packing and base covering for infinite matroids
Pages 153-180  |  DOI:10.1007/s00493-014-2953-2

Bart De Bruyn, Frederic Vanhove
On Q-polynomial regular near 2d-gons
Pages 181-208  |  DOI:10.1007/s00493-014-3039-x

Jim Geelen, Peter Nelson
An analogue of the Erdős-Stone theorem for finite geometries
Pages 209-214  |  DOI:10.1007/s00493-014-2952-3

Assaf Rinot
Chromatic numbers of graphs — large gaps
Pages 215-233  |  DOI:10.1007/s00493-014-3074-7

Pablo Soberón
Equal coefficients and tolerance in coloured Tverberg partitions
Pages 235-252  |  DOI:10.1007/s00493-014-2969-7

Volume 35, Issue 3, April 2015

Nikhil Bansal, Rudi A. Pendavingh, Jorn G. van der Pol
On the number of matroids
Pages 253-277  |  DOI:10.1007/s00493-014-3029-z

Geoffrey R. Grimmett, Zhongyang Li
Bounds on connective constants of regular graphs
Pages 279-294  |  DOI:10.1007/s00493-014-3044-0

Alex Iosevich, Misha Rudnev, Yujia Zhai
Areas of triangles and Beck’s theorem in planes over finite fields
Pages 295-308  |  DOI:10.1007/s00493-014-2977-7

Richard J. Martin, Michael J. Kearney
Integral representation of certain combinatorial recurrences
Pages 309-315  |  DOI:10.1007/s00493-014-3183-3

Elchanan Mossel, Miklós Z. Rácz
A quantitative Gibbard-Satterthwaite theorem without neutrality
Pages 317-387  |  DOI:10.1007/s00493-014-2979-5

Volume 35, Issue 4, August 2015

Maria Chudnovsky, Paul Seymour
Excluding paths and antipaths
Pages 389-412  |  DOI:10.1007/s00493-014-3000-z

Tao Feng, Koji Momihara, Qing Xiang
Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes
Pages 413-434  |  DOI:10.1007/s00493-014-2895-8

Jacob Fox, Po-Shen Loh, Yufei Zhao
The critical window for the classical Ramsey-Turán problem
Pages 435-476  |  DOI:10.1007/s00493-014-3025-3

Ken-ichi Kawarabayashi, Yusuke Kobayashi
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
Pages 477-495  |  DOI:10.1007/s00493-014-2828-6

H. A. Kierstead, A. V. Kostochka
A refinement of a result of Corrádi and Hajnal
Pages 497-512  |  DOI:10.1007/s00493-014-3059-6

Volume 35, Issue 5, October 2015

Cesar Ceballos, Francisco Santos, Günter M. Ziegler
Many non-equivalent realizations of the associahedron
Pages 513-551  |  DOI:10.1007/s00493-014-2959-9

Matt DeVos, Bojan Mohar, Robert Šámal
Highly arc-transitive digraphs — Structure and counterexamples
Pages 553-571  |  DOI:10.1007/s00493-014-3040-4

David Ellis, Yuval Filmus, Ehud Friedgut
A quasi-stability result for dictatorships in S n
Pages 573-618  |  DOI:10.1007/s00493-014-3027-1

Richard Hoshino, Ken-ichi Kawarabayashi
The edge density of critical digraphs
Pages 619-631  |  DOI:10.1007/s00493-014-2862-4

Eckhard Steffen
Intersecting 1-factors and nowhere-zero 5-flows
Pages 633-640  |  DOI:10.1007/s00493-014-3034-2

Volume 35, Issue 6, December 2015

Funda Ergun, Hossein Jowhari
On the monotonicity of a data stream
Pages 641-653  |  DOI:10.1007/s00493-014-3035-1

Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie
On order and rank of graphs
Pages 655-668  |  DOI:10.1007/s00493-015-2922-4

R. Bruce Richter, Brendan Rooney
Embedding a graph-like continuum in a surface
Pages 669-694  |  DOI:10.1007/s00493-014-3079-2

Tomasz Schoen
New bounds in Balog-Szemerédi-Gowers theorem
Pages 695-701  |  DOI:10.1007/s00493-014-3077-4

Emanuele Viola
The communication complexity of addition
Pages 703-747  |  DOI:10.1007/s00493-014-3078-3

Volume 36, Issue 1, February 2016

Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka
Tight lower bounds for linear 2-query LCCs over finite fields
Pages 1-36  |  DOI:10.1007/s00493-015-3024-z

David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
Ramsey numbers of cubes versus cliques
Pages 37-70  |  DOI:10.1007/s00493-014-3010-x

Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton
On the Ramsey number of the triangle and the cube
Pages 71-89  |  DOI:10.1007/s00493-015-3089-8

Tali Kaufman, Avi Wigderson
Symmetric LDPC codes and local testing
Pages 91-120  |  DOI:10.1007/s00493-014-2715-1

Tsai-Lien Wong, Xuding Zhu
Every graph is (2,3)-choosable
Pages 121-127  |  DOI:10.1007/s00493-014-3057-8

Volume 36, Issue 2, April 2016

Ben Green, Robert Morris
Counting sets with small sumset and applications
Pages 129-159  |  DOI:10.1007/s00493-015-3129-4

Venkatesan Guruswami, Swastik Kopparty
Explicit subspace designs
Pages 161-185  |  DOI:10.1007/s00493-014-3169-1

Guy Moshkovitz, Asaf Shapira
A short proof of Gowers’ lower bound for the regularity lemma
Pages 187-194  |  DOI:10.1007/s00493-014-3166-4

Ori Parzanchevski, Ron Rosenthal, Ran J. Tessler
Isoperimetric inequalities in simplicial complexes
Pages 195-227  |  DOI:10.1007/s00493-014-3002-x

Alain Plagne, Anne de Roton
Maximal sets with no solution to x+y=3z
Pages 229-248  |  DOI:10.1007/s00493-015-3100-4

Volume 36, Issue 3, June 2016

Gregory Cherlin, Saharon Shelah
Universal graphs with a forbidden subgraph: Block path solidity
Pages 249-264  |  DOI:10.1007/s00493-014-3181-5

Justin Gilmer, Michael Saks, Srikanth Srinivasan
Composition limits and separating examples for some boolean function complexity measures
Pages 265-311  |  DOI:10.1007/s00493-014-3189-x

Matthias Hamann
Spanning trees in hyperbolic graphs
Pages 313-332  |  DOI:10.1007/s00493-015-3082-2

Florian Lehner
Distinguishing graphs with intermediate growth
Pages 333-347  |  DOI:10.1007/s00493-015-3071-5

Adam Sheffer, Joshua Zahl, Frank de Zeeuw
Few distinct distances implies no heavy lines or circles
Pages 349-364  |  DOI:10.1007/s00493-014-3180-6

Igor Protasov, Sergii Slobodianiuk
Note: A conjecture on partitions of groups
Pages 365-369  |  DOI:10.1007/s00493-014-3208-y

Volume 36, Issue 4, August 2016

Edward Dobson, Pablo Spiga, Gabriel Verret
Cayley graphs on abelian groups
Pages 371-393  |  DOI:10.1007/s00493-015-3136-5

Chris Godsil, David E. Roberson, Robert Šámal, Simone Severini
Sabidussi versus Hedetniemi for three variations of the chromatic number
Pages 395-415  |  DOI:10.1007/s00493-014-3132-1

Andreas F. Holmsen, Edgardo Roldán-Pensado
The colored Hadwiger transversal theorem in ℝ d
Pages 417-429  |  DOI:10.1007/s00493-014-3192-2

Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter
Tree-width and dimension
Pages 431-450  |  DOI:10.1007/s00493-014-3081-8

Daniela Kühn, Deryk Osthus, Timothy Townsend
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
Pages 451-469  |  DOI:10.1007/s00493-015-3186-8

Allan Lo
Properly coloured Hamiltonian cycles in edge-coloured complete graphs
Pages 471-492  |  DOI:10.1007/s00493-015-3067-1

Volume 36, Issue 5, October 2016

Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov
On the densities of cliques and independent sets in graphs
Pages 493-512  |  DOI:10.1007/s00493-015-3051-9

Dieter Jungnickel, Klaus Metsch
The characterization problem for designs with the parameters of AGd(n, q)
Pages 513-535  |  DOI:10.1007/s00493-014-3212-2

Jie Ma, Xingxing Yu
On judicious bipartitions of graphs
Pages 537-556  |  DOI:10.1007/s00493-015-2944-y

Alexander Stoimenow
A theorem on graph embedding with a relation to hyperbolic volume
Pages 557-589  |  DOI:10.1007/s00493-014-2840-x

Andreas Thom
The expected degree of minimal spanning forests
Pages 591-600  |  DOI:10.1007/s00493-014-3160-x

Carsten Thomassen
Orientations of infinite graphs with prescribed edge-connectivity
Pages 601-621  |  DOI:10.1007/s00493-015-3173-0

Volume 36, Issue 6, December 2016

Shagnik Das, Wenying Gan, Benny Sudakov
The minimum number of disjoint pairs in set systems and related problems
Pages 623-660  |  DOI:10.1007/s00493-014-3133-0

Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression
Pages 661-686  |  DOI:10.1007/s00493-015-3070-6

Michael J. Ferrara, Timothy D. Lesaulnier, Casey K. Moffatt
On the sum necessary to ensure that a degree sequence is potentially H-graphic
Pages 687-702  |  DOI:10.1007/s00493-015-2986-1

Lauren Keough, Andrew J. Radcliffe
Graphs with the fewest matchings
Pages 703-723  |  DOI:10.1007/s00493-014-3188-y

Klaus Metsch
Small tight sets in finite elliptic, parabolic and Hermitian polar spaces
Pages 725-744  |  DOI:10.1007/s00493-015-3260-2

Volume 37, Issue 1, February 2017

Karim A. Adiprasito, Bruno Benedetti
Subdivisions, shellability, and collapsibility of products
Pages 1-30  |  DOI:10.1007/s00493-016-3149-8

Jeff Cooper, Dhruv Mubayi
Sparse hypergraphs with low independence number
Pages 31-40  |  DOI:10.1007/s00493-014-3219-8

Jim Geelen, Peter Nelson
Odd circuits in dense binary matroids
Pages 41-47  |  DOI:10.1007/s00493-015-3237-1

Jan Hladký, Daniel Král’, Sergey Norin
Counting flags in triangle-free digraphs
Pages 49-76  |  DOI:10.1007/s00493-015-2662-5

Henry A. Kierstead, Alexandr V. Kostochka, Elyse C. Yeager
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles
Pages 77-86  |  DOI:10.1007/s00493-015-3291-8

Kaushik Majumder
On the maximum number of points in a maximal intersecting family of finite sets
Pages 87-97  |  DOI:10.1007/s00493-015-3275-8

Rom Pinchasi
On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane
Pages 99-125  |  DOI:10.1007/s00493-015-3217-5

Volume 37, Issue 2, April 2017

Karim A. Adiprasito, Arnau Padrol
The universality theorem for neighborly polytopes
Pages 129-136  |  DOI:10.1007/s00493-016-3253-9

Levent Alpoge
Square-root cancellation for the signs of Latin squares
Pages 137-142  |  DOI:10.1007/s00493-015-3373-7

Diana Ojeda-Aristizabal
Finite forms of Gowers’ theorem on the oscillation stability of C 0
Pages 143-155  |  DOI:10.1007/s00493-015-3223-7

Eli Berger
Unfriendly partitions for graphs not containing a subdivision of an infinite clique
Pages 157-166  |  DOI:10.1007/s00493-015-3261-1

Tai Do Duc, Bernhard Schmidt
Unique differences in symmetric subsets of F P
Pages 167-182  |  DOI:10.1007/s00493-015-3282-9

Matthias Hamann
The classification of finite and locally finite connected-homogeneous digraphs
Pages 183-222  |  DOI:10.1007/s00493-015-2804-9

Michael A. Henning, Sandi Klavžar, Douglas F. Rall
The 4/5 upper bound on the game total domination number
Pages 223-251  |  DOI:10.1007/s00493-015-3316-3

Massimo Lauria, Pavel Pudlák, Vojtěch Rödl, Neil Thapen
The complexity of proving that a graph is Ramsey
Pages 253-268  |  DOI:10.1007/s00493-015-3193-9

David Perkinson, Qiaoyu Yang, Kuai Yu
G-parking functions and tree inversions
Pages 269-282  |  DOI:10.1007/s00493-015-3191-y

Joseph A. Thas, Hendrik Van Maldeghem
Finite affine planes in projective spaces
Pages 283-311  |  DOI:10.1007/s00493-014-3179-z

Volume 37, Issue 3, June 2017

Iskander Aliev, Robert Bassett, Jesús A. De Loera, Quentin Louveaux
A quantitative Doignon-Bell-Scarf theorem
Pages 313-332  |  DOI:10.1007/s00493-015-3266-9

Itai Benjamini, Hilary Finucane, Romain Tessera
On the scaling limit of finite vertex transitive graphs with large diameter
Pages 333-374  |  DOI:10.1007/s00493-015-2975-4

Mauro Biliotti, Alessandro Montinaro
On the rigidity of the Figueroa replacement in PG(2, q 3)
Pages 375-395  |  DOI:10.1007/s00493-015-3337-y

Pete L. Clark, Aden Forrow, John R. Schmitt
Warning’s Second Theorem with restricted variables
Pages 397-417  |  DOI:10.1007/s00493-015-3267-8

Gil Cohen, Amir Shpilka, Avishay Tal
On the degree of univariate polynomials over the integers
Pages 419-464  |  DOI:10.1007/s00493-015-2987-0

Natalia Iyudu, Stanislav Shkarin
Asymptotically optimal k-step nilpotency of quadratic algebras and the Fibonacci numbers
Pages 465-479  |  DOI:10.1007/s00493-016-3009-6

Alexandr Kostochka, Benny Sudakov, Jacques Verstraëte
Cycles in triangle-free graphs of large chromatic number
Pages 481-494  |  DOI:10.1007/s00493-015-3262-0

Lothar Narins, Alexey Pokrovskiy, Tibor Szabó
Graphs without proper subgraphs of minimum degree 3 and short cycles
Pages 495-519  |  DOI:10.1007/s00493-015-3310-9

Eszter Rozgonyi, Csaba Sándor
An extension of Nathanson’s Theorem on representation functions
Pages 521-537  |  DOI:10.1007/s00493-015-3311-8

Terence Tao, Van Vu
Random matrices have simple spectrum
Pages 539-553  |  DOI:10.1007/s00493-016-3363-4

Volume 37, Issue 4, August 2017

Ron Aharoni, Tomáš Kaiser, Shira Zerbib
Fractional covers and matchings in families of weighted d-intervals
Pages 555-572  |  DOI:10.1007/s00493-016-3174-7

Peter Allen, Julia Böttcher, Hiệp Hàn, Yoshiharu Kohayakawa, Yury Person
Powers of Hamilton cycles in pseudorandom graphs
Pages 573-616  |  DOI:10.1007/s00493-015-3228-2

József Balogh, Neal Bushaw, Maurício Collares, Hong Liu, Robert Morris
The typical structure of graphs with no large cliques
Pages 617-632  |  DOI:10.1007/s00493-015-3290-9

Alexander Barvinok, Pablo Soberón
Computing the partition function for graph homomorphisms
Pages 633-650  |  DOI:10.1007/s00493-016-3357-2

Péter L. Erdős, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
Regular families of forests, antichains and duality pairs of relational structures
Pages 651-672  |  DOI:10.1007/s00493-015-3003-4

Daniel Horsley
Generalising Fisher’s inequality to coverings and packings
Pages 673-696  |  DOI:10.1007/s00493-016-3326-9

Michael Krivelevich, Choongbum Lee, Benny Sudakov
Compatible Hamilton cycles in Dirac graphs
Pages 697-732  |  DOI:10.1007/s00493-016-3328-7

Anton Malyshev, Igor Pak
Lifts, derandomization, and diameters of Schreier graphs of Mealy automata
Pages 733-765  |  DOI:10.1007/s00493-016-3306-0

Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht
An exponential-type upper bound for Folkman numbers
Pages 767-784  |  DOI:10.1007/s00493-015-3298-1

Carsten Thomassen
Infinitely connected subgraphs in graphs of uncountable chromatic number
Pages 785-793  |  DOI:10.1007/s00493-016-3436-4

Volume 37, Issue 5, October 2017

Aart Blokhuis, Andries E. Brouwer
Cocliques in the Kneser graph on line-plane flags in PG(4;q)
Pages 795-804  |  DOI:10.1007/s00493-016-3438-2

Eda Cesaratto, Guillermo Matera, Mariana Pérez
The distribution of factorization patterns on linear families of polynomials over a finite field
Pages 805-836  |  DOI:10.1007/s00493-015-3330-5

Daniel W. Cranston, Landon Rabern
The fractional chromatic number of the plane
Pages 837-861  |  DOI:10.1007/s00493-016-3380-3

Zdeněk Dvořák, Luke Postle
Density of 5/2-critical graphs
Pages 863-886  |  DOI:10.1007/s00493-016-3356-3

Herbert Edelsbrunner, Alexey Glazyrin, Oleg R. Musin, Anton Nikitenko
The Voronoi functional is maximized by the Delaunay triangulation in the plane
Pages 887-910  |  DOI:10.1007/s00493-016-3308-y

Jacob Fox, László Miklós Lovász
A tight lower bound for Szemerédi’s regularity lemma
Pages 911-951  |  DOI:10.1007/s00493-016-3274-4

Konstantin Golubev
On the chromatic number of a simplicial complex
Pages 953-964  |  DOI:10.1007/s00493-016-3137-z

Mark Jerrum, Kitty Meeks
The parameterised complexity of counting even and odd induced subgraphs
Pages 965-990  |  DOI:10.1007/s00493-016-3338-5

Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon
The multiplication table problem for bipartite graphs
Pages 991-1010  |  DOI:10.1007/s00493-016-3322-0

James H. Schmerl
Chromatic numbers of algebraic hypergraphs
Pages 1011-1026  |  DOI:10.1007/s00493-016-3393-y

Carsten Thomassen
Nash-Williams’ cycle-decomposition theorem
Pages 1027-1037  |  DOI:10.1007/s00493-016-3424-8

Volume 37, Issue 6, December 2017

Victor Chepoi
Distance-Preserving Subgraphs of Johnson Graphs
Pages 1039-1055  |  DOI:10.1007/s00493-016-3421-y

Maria Chudnovsky, Alex Scott, Paul Seymour
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes
Pages 1057-1072  |  DOI:10.1007/s00493-016-3467-x

Antonio Cossidente, Francesco Pavese
Subspace Codes in PG(2N − 1, Q)
Pages 1073-1095  |  DOI:10.1007/s00493-016-3354-5

Genghua Fan
Integer 4-Flows and Cycle Covers
Pages 1097-1112  |  DOI:10.1007/s00493-016-3379-9

Ervin Győri, Balázs Keszegh
On the Number of Edge-Disjoint Triangles in K4-Free Graphs
Pages 1113-1124  |  DOI:10.1007/s00493-016-3500-0

Hongbi Jiang, Daqing Yang
Decomposing a Graph into Forests: The Nine Dragon Tree Conjecture is True
Pages 1125-1137  |  DOI:10.1007/s00493-016-3390-1

Tomasz Krawczyk, Bartosz Walczak
On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations
Pages 1139-1179  |  DOI:10.1007/s00493-016-3414-x

Andrey B. Kupavskii, Alexandr Polyanskii
Proof of Schur’s Conjecture in ℝD
Pages 1181-1205  |  DOI:10.1007/s00493-016-3340-y

Torsten Mütze, Pascal Su
Bipartite Kneser Graphs are Hamiltonian
Pages 1207-1219  |  DOI:10.1007/s00493-016-3434-6

Orit E. Raz, Micha Sharir
The Number of Unit-Area Triangles in the Plane: Theme and Variation
Pages 1221-1240  |  DOI:10.1007/s00493-016-3440-8

Volume 38, Issue 1, February 2018

João Araújo, Wolfram Bentz, Edward Dobson, Janusz Konieczny, Joy Morris
Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory
Pages 1-28  |  DOI:10.1007/s00493-016-3403-0

Eric Balandraud, Fabio Tardella, Maurice Queyranne
Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations
Pages 29-41  |  DOI:10.1007/s00493-016-3426-6

John Bamberg, Melissa Lee, Koji Momihara, Qing Xiang
A New Infinite Family of Hemisystems of the Hermitian Surface
Pages 43-66  |  DOI:10.1007/s00493-016-3525-4

Aart Blokhuis, Hao Chen
Selectively Balancing Unit Vectors
Pages 67-74  |  DOI:10.1007/s00493-016-3635-z

Tristram C. Bogart, Edward D. Kim
Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count
Pages 75-114  |  DOI:10.1007/s00493-016-3327-8

Gabe Cunningham
Tight Chiral Polyhedra
Pages 115-142  |  DOI:10.1007/s00493-016-3505-8

Bence Csajbók
On Bisecants of Rédei Type Blocking Sets and Applications
Pages 143-166  |  DOI:10.1007/s00493-016-3442-6

Jim Geelen, Rohan Kapadia
Computing Girth and Cogirth in Perturbed Graphic Matroids
Pages 167-191  |  DOI:10.1007/s00493-016-3445-3

Rohan Kapadia
The Extremal Functions of Classes of Matroids of Bounded Branch-Width
Pages 193-218  |  DOI:10.1007/s00493-016-3425-7

Misha Rudnev
On the Number of Incidences Between Points and Planes in Three Dimensions
Pages 219-254  |  DOI:10.1007/s00493-016-3329-6

Volume 38, Issue 2, April 2018

Daniele Bartoli, Massimo Giulietti, Giuseppe Marino, Olga Polverino
Maximum Scattered Linear Sets and Complete Caps in Galois Spaces
Pages 255-278  |  DOI:10.1007/s00493-016-3531-6

David Bevan
Intervals of Permutation Class Growth Rates
Pages 279-303  |  DOI:10.1007/s00493-016-3349-2

Nathan Bowler, Johannes Carmesin, Robin Christian
Infinite Graphic Matroids
Pages 305-339  |  DOI:10.1007/s00493-016-3178-3

Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari
Local Convergence of Random Graph Colorings
Pages 341-380  |  DOI:10.1007/s00493-016-3394-x

Reinhard Diestel, Malte Müller
Connected Tree-Width
Pages 381-398  |  DOI:10.1007/s00493-016-3516-5

Nick Gill, Neil I. Gillespie, Jason Semeraro
Conway Groupoids and Completely Transitive Codes
Pages 399-442  |  DOI:10.1007/s00493-016-3433-7

Carsten Lange, Vincent Pilaud
Associahedra Via Spines
Pages 443-486  |  DOI:10.1007/s00493-015-3248-y

Adam Sheffer, Endre Szabó, Joshua Zahl
Point-Curve Incidences in the Complex Plane
Pages 487-499  |  DOI:10.1007/s00493-016-3441-7

Jacob Fox, János Pach, Andrew Suk
More Distinct Distances Under Local Conditions
Pages 501-509  |  DOI:10.1007/s00493-016-3637-x

Volume 38, Issue 3, June 2018

Javier Cilleruelo, Rafael Tesoro
On Sets Free of Sumsets with Summands of Prescribed Size
Pages 511-546  |  DOI:10.1007/s00493-016-3444-4

Venkatesan Guruswami, Euiwoong Lee
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs
Pages 547-599  |  DOI:10.1007/s00493-016-3383-0

Simao Herdade, John Kim, Swastik Koppartyy
A Cauchy-Davenport Theorem for Linear Maps
Pages 601-618  |  DOI:10.1007/s00493-016-3486-7

Carlos Hoppen, Nicholas Wormald
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs
Pages 619-664  |  DOI:10.1007/s00493-016-3236-x

Elchanan Mossel, Joe Neeman, Allan Sly
A Proof of the Block Model Threshold Conjecture
Pages 665-708  |  DOI:10.1007/s00493-016-3238-8

Daniel Pellicer
Cleaved Abstract Polytopes
Pages 709-737  |  DOI:10.1007/s00493-016-3518-3

Morgan Rodgers, Leo Storme, Andries Vansweevelt
Cameron-Liebler k-Classes in PG(2k+1, q)
Pages 739-757  |  DOI:10.1007/s00493-016-3482-y

Volume 38, Issue 4, August 2018

Christine Bachoc, Oriol Serra, Gilles Zémor
Revisiting Kneser’s Theorem for Field Extensions
Pages 759-777  |  DOI:10.1007/s00493-016-3529-0

Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices
Pages 779-801  |  DOI:10.1007/s00493-017-3553-8

Shaofei Du, Wenqin Xu, Guiying Yan
2-Arc-Transitive Regular Covers of Kn,n Having the Covering Transformation Group ℤ p 2
Pages 803-826  |  DOI:10.1007/s00493-016-3511-x

Agnieszka Figaj, Tomasz Łuczak
The Ramsey Numbers for A Triple of Long Cycles
Pages 827-845  |  DOI:10.1007/s00493-016-2433-y

Matthias Hamann
Accessibility in Transitive Graphs
Pages 847-859  |  DOI:10.1007/s00493-017-3361-1

Kolja Knauer, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín
How Many Circuits Determine an Oriented Matroid?
Pages 861-885  |  DOI:10.1007/s00493-016-3556-x

Alexandr Kostochka, Matthew Yancey
A Brooks-Type Result for Sparse Critical Graphs
Pages 887-934  |  DOI:10.1007/s00493-017-3068-3

František Matúš
Classes of Matroids Closed Under Minors and Principal Extensions
Pages 935-954  |  DOI:10.1007/s00493-017-3534-y

Rudi Pendavingh, Jorn van der Pol
On the Number of Bases of Almost All Matroids
Pages 955-985  |  DOI:10.1007/s00493-016-3594-4

Guus Regts
Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits
Pages 987-1015  |  DOI:10.1007/s00493-016-3506-7

Péter Komjáth
Note A Ramsey Statement for Infinite Groups
Pages 1017-1020  |  DOI:10.1007/s00493-016-3706-1

Volume 38, Issue 5, October 2018

Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs
Pages 1021-1043  |  DOI:10.1007/s00493-017-3593-0

Daniel W. Cranston, Landon Rabern
Edge Lower Bounds for List Critical Graphs, Via Discharging
Pages 1045-1065  |  DOI:10.1007/s00493-016-3584-6

Mauro Di Nasso, Maria Riggio
Fermat-Like Equations that are not Partition Regular
Pages 1067-1078  |  DOI:10.1007/s00493-016-3640-2

Peter Frankl
Resilient Hypergraphs with Fixed Matching Number
Pages 1079-1094  |  DOI:10.1007/s00493-016-3579-3

Brandon Hanson
The Additive Structure of Cartesian Products Spanning Few Distinct Distances
Pages 1095-1100  |  DOI:10.1007/s00493-016-3665-6

Rintaro Ikeshita, Shin-ichi Tanigawa
Count Matroids of Group-Labeled Graphs
Pages 1101-1127  |  DOI:10.1007/s00493-016-3469-8

Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and Dimension
Pages 1129-1148  |  DOI:10.1007/s00493-017-3638-4

Ben Lund
Essential Dimension and the Flats Spanned by a Point Set
Pages 1149-1174  |  DOI:10.1007/s00493-016-3602-8

Péter Pál Pach, Csaba Sándor
Multiplicative Bases and an Erdős Problem
Pages 1175-1203  |  DOI:10.1007/s00493-016-3588-2

Shubhangi Saraf, Ilya Volkovich
Black-Box Identity Testing of Depth-4 Multilinear Circuits
Pages 1205-1238  |  DOI:10.1007/s00493-016-3460-4

Victor A. Vassiliev
Topology of Complexes of Edge Covering Partite Graphs and Hypergraphs
Pages 1239-1249  |  DOI:10.1007/s00493-017-3508-0

Yujun Yang, Dong Ye
Inverses of Bipartite Graphs
Pages 1251-1263  |  DOI:10.1007/s00493-016-3502-y

Tamás Fleiner
A Note on Restricted List Edge-Colourings
Pages 1265-1267  |  DOI:10.1007/s00493-018-3888-9

Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh
A Simple Proof of Optimal Epsilon Nets
Pages 1269-1277  |  DOI:10.1007/s00493-017-3564-5

Sang-Il Oum, Sounggun Wee
A Remark on the Paper “Properties of Intersecting Families of Ordered Sets” by O. Einstein
Pages 1279-1284  |  DOI:10.1007/s00493-018-3812-3

Volume 38, Issue 6, December 2018

Chidambaram Annamalai
Finding Perfect Matchings in Bipartite Hypergraphs
Pages 1285-1307  |  DOI:10.1007/s00493-017-3567-2

M. Amin Bahmanian, Mike Newman
Extending Factorizations of Complete Uniform Hypergraphs
Pages 1309-1335  |  DOI:10.1007/s00493-017-3396-3

Eli Berger, Zdeněk Dvořák, Sergey Norin
Treewidth of Grid Subsets
Pages 1337-1352  |  DOI:10.1007/s00493-017-3538-5

Türker Biyikoğlu, Yusuf Civan
Castelnuovo-Mumford Regularity of Graphs
Pages 1353-1383  |  DOI:10.1007/s00493-017-3450-1

Marcel Celaya
On the Linear Span of Lattice Points in a Parallelepiped
Pages 1385-1413  |  DOI:10.1007/s00493-017-3562-7

David Gajser, Bojan Mohar
Minimal Normal Graph Covers
Pages 1415-1436  |  DOI:10.1007/s00493-017-3559-2

Satoru Iwata, Yu Yokoi
List Supermodular Coloring
Pages 1437-1456  |  DOI:10.1007/s00493-017-3670-4

Sofia Lindqvist
Partition Regularity of Generalised Fermat Equations
Pages 1457-1483  |  DOI:10.1007/s00493-017-3654-4

András Mészáros
Note a Note on Disjoint Dijoins
Pages 1485-1488  |  DOI:10.1007/s00493-018-3862-6

Volume 39, Issue 1, February 2019

Henning Bruhn, Matthias Heinlein, Felix Joos
Long Cycles have the Edge-Erdős-Pósa Property
Pages 1-36  |  DOI:10.1007/s00493-017-3669-x

Reinhard Diestel, Fabian Hundertmark, Sahar Lemanczyk
Profiles of Separations: in Graphs, Matroids, and Beyond
Pages 37-75  |  DOI:10.1007/s00493-017-3595-y

Jiří Fink
Matchings Extend into 2-Factors in Hypercubes
Pages 77-84  |  DOI:10.1007/s00493-017-3731-8

Ron Holzman, Nitzan Tur
Simultaneous Linear Discrepancy for Unions of Intervals
Pages 85-90  |  DOI:10.1007/s00493-017-3769-7

Tony Huynh, Felix Joos, Paul Wollan
A Unified Erdős–Pósa Theorem for Constrained Cycles
Pages 91-133  |  DOI:10.1007/s00493-017-3683-z

Michael Krivelevich
Long Cycles in Locally Expanding Graphs, with Applications
Pages 135-151  |  DOI:10.1007/s00493-017-3701-1

Andrey Kupavskii, János Pach, István Tomon
On the Size of K-Cross-Free Families
Pages 153-164  |  DOI:10.1007/s00493-017-3792-8

Chris Lambie-Hanson, Assaf Rinot
Reflection on the Coloring and Chromatic Numbers
Pages 165-214  |  DOI:10.1007/s00493-017-3741-6

Bhargav Narayanan, Julian Sahasrabudhe, István Tomon
Ramsey Graphs Induce Subgraphs of Many Different Sizes
Pages 215-237  |  DOI:10.1007/s00493-017-3755-0

Volume 39, Issue 2, April 2019

Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture
Pages 239-263  |  DOI:10.1007/s00493-017-3661-5

Sally Dong, Jim Geelen
Improved Bounds for Rota's Basis Conjecture
Pages 265-272  |  DOI:10.1007/s00493-018-3859-1

Sean Eberhard, Stefan-Christoph Virchow
The Probability of Generating the Symmetric Group
Pages 273-288  |  DOI:10.1007/s00493-017-3629-5

Alexander L. Gavrilyuk, Jack H. Koolen
A Characterization of the Graphs of Bilinear (d×d)-Forms over \(\mathbb{F}_2\)
Pages 289-321  |  DOI:10.1007/s00493-017-3573-4

Ashish Goel, Michael Kapralov, Sanjeev Khanna
Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs
Pages 323-354  |  DOI:10.1007/s00493-015-2653-6

Choongbum Lee, Brandon Tran
The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers
Pages 355-376  |  DOI:10.1007/s00493-017-3474-6

Patrice Ossona De Mendez, Sang-Il Oum, David R. Wood
Defective Colouring of Graphs Excluding A Subgraph or Minor
Pages 377-410  |  DOI:10.1007/s00493-018-3733-1

Thang Pham, Le Anh Vinh, Frank de Zeeuw
Three-Variable Expanding Polynomials and Higher-Dimensional Distinct Distances
Pages 411-426  |  DOI:10.1007/s00493-017-3773-y

Naser T. Sardari
Diameter of Ramanujan Graphs and Random Cayley Graphs
Pages 427-446  |  DOI:10.1007/s00493-017-3605-0

Pablo Soberón
Tverberg Partitions as Weak Epsilon-Nets
Pages 447-458  |  DOI:10.1007/s00493-018-3912-0

Yu Yokoi
List Supermodular Coloring with Shorter Lists
Pages 459-475  |  DOI:10.1007/s00493-018-3830-1

Volume 39, Issue 3, June 2019

Pavle V. M. Blagojević, Albert Haase, Günter M. Ziegler
Tverberg-Type Theorems for Matroids: A Counterexample and a Proof
Pages 477-500  |  DOI:10.1007/s00493-018-3846-6

Maarten de Boeck, Geertrui van de Voorde
Elation KM-Arcs
Pages 501-544  |  DOI:10.1007/s00493-018-3806-1

Johannes Carmesin
All Graphs Have Tree-Decompositions Displaying Their Topological Ends
Pages 545-596  |  DOI:10.1007/s00493-018-3572-0

Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran
Twenty (Short) Questions
Pages 597-626  |  DOI:10.1007/s00493-018-3803-4

Florian Frick, Shira Zerbib
Colorful Coverings of Polytopes and Piercing Numbers of Colorful d-Intervals
Pages 627-637  |  DOI:10.1007/s00493-018-3891-1

Lior Gishboliner, Asaf Shapira
Efficient Removal Without Efficient Regularity
Pages 639-658  |  DOI:10.1007/s00493-018-3899-6

Stefanie Huber, Stefan Geschke, Menachem Kojman
Partitioning Subgraphs of Profinite Ordered Graphs
Pages 659-678  |  DOI:10.1007/s00493-018-3479-9

Dhruv Mubayi, Lujia Wang
The Number of Triple Systems Without Even Cycles
Pages 679-704  |  DOI:10.1007/s00493-018-3765-6

Cosmin Pohoata, Adam Sheffer
Local Properties in Colored Graphs, Distinct Distances, and Difference Sets
Pages 705-714  |  DOI:10.1007/s00493-018-3890-2

Volume 39, Issue 4, August 2019

Ahmad Abdi, Bertrand Guenin
The Minimally Non-Ideal Binary Clutters with a Triangle
Pages 719-752  |  DOI:10.1007/s00493-018-3708-2

Ahmad Abdi, Bertrand Guenin
The Two-Point Fano and Ideal Binary Clutters
Pages 753-777  |  DOI:10.1007/s00493-018-3779-0

Hyungryul Baik, Bram Petri, Jean Raimbault
Subgroup Growth of Virtually Cyclic Right-Angled Coxeter Groups and Their Free Products
Pages 779-811  |  DOI:10.1007/s00493-019-4023-2

Yong-Gao Chen, Jin-Hui Fang
Additive Complements with Narkiewicz's Condition
Pages 813-823  |  DOI:10.1007/s00493-018-3947-2

Carolyn Chun, James Oxley
Internally 4-Connected Binary Matroids with Every Element in Three Triangles
Pages 825-845  |  DOI:10.1007/s00493-019-3720-1

Louis DeBiasio, Paul McKenney
Density of Monochromatic Infinite Subgraphs
Pages 847-878  |  DOI:10.1007/s00493-018-3724-2

Reinhard Diestel, Sang-il Oum
Tangle-Tree Duality: In Graphs, Matroids and Beyond
Pages 879-910  |  DOI:10.1007/s00493-019-3798-5

Tomas Juškevičius, Grazvydas Šemetulskis
Optimal Littlewood-Offord Inequalities in Groups
Pages 911-921  |  DOI:10.1007/s00493-018-3845-7

Danny Nguyen, Igor Pak
VC-Dimensions of Short Presburger Formulas
Pages 923-932  |  DOI:10.1007/s00493-018-4004-x

Mustazee Rahman, Bálint Virág, Máté Vizer
Geometry of Permutation Limits
Pages 933-960  |  DOI:10.1007/s00493-019-3817-6

Volume 39, Issue 5, November 2019

Louis Bellmann, Christian Reiher
Turán’s Theorem for the Fano Plane
Pages 961-982  |  DOI:10.1007/s00493-019-3981-8

Maria Chudnovsky, Jacob Fox, Alex Scott, Paul Seymour, Sophie Spirkl
Towards Erdős-Hajnal for Graphs with No 5-Hole
Pages 983-991  |  DOI:10.1007/s00493-019-3957-8

Agelos Georgakopoulos, Matthias Hamann
The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs
Pages 993-1019  |  DOI:10.1007/s00493-019-3763-3

Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring Dense Digraphs
Pages 1021-1053  |  DOI:10.1007/s00493-019-3815-8

Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere Dense Graph Classes and Dimension
Pages 1055-1079  |  DOI:10.1007/s00493-019-3892-8

Rose McCarty, Robin Thomas
The Extremal Function for Bipartite Linklessly Embeddable Graphs
Pages 1081-1104  |  DOI:10.1007/s00493-019-3856-z

Alex Scott, Paul Seymour
Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue
Pages 1105-1132  |  DOI:10.1007/s00493-019-3804-y

Uri Shapira, Reut Zuck
Asymptotic Metric Behavior of Random Cayley Graphs of Finite Abelian Groups
Pages 1133-1148  |  DOI:10.1007/s00493-017-3672-2

Adam Bene Watts, Sergey Norin, Liana Yepremyan
A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians
Pages 1149-1171  |  DOI:10.1007/s00493-019-3831-8

Jeroen Zuiddam
The Asymptotic Spectrum of Graphs and the Shannon Capacity
Pages 1173-1184  |  DOI:10.1007/s00493-019-3992-5

Shahram Mohsenipour, Saharon Shelah
On Finitary Hindman Numbers
Pages 1185-1189  |  DOI:10.1007/s00493-019-4002-7

Volume 39, Issue 6, December 2019

Ron Aharoni, Ron Holzman, Zilin Jiang
Rainbow Fractional Matchings
Pages 1191-1202  |  DOI:10.1007/s00493-019-4019-y

Daniela A. Amato
Highly-Arc-Transitive and Descendant-Homogeneous Digraphs with Finite Out-Valency
Pages 1203-1223  |  DOI:10.1007/s00493-019-3906-6

Nathan Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher
The Colouring Number of Infinite Graphs
Pages 1225-1235  |  DOI:10.1007/s00493-019-4045-9

Zdeněk Dvořák, Bojan Mohar, Robert Šámal
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows
Pages 1237-1253  |  DOI:10.1007/s00493-019-3882-x

Peter Frankl, Andrey Kupavskii
Incompatible Intersection Properties
Pages 1255-1266  |  DOI:10.1007/s00493-019-4064-6

Radoslav Fulek, Jan Kynčl
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4
Pages 1267-1279  |  DOI:10.1007/s00493-019-3905-7

Yahya O. Hamidoune
Hyper-Atoms Applied to the Critical Pair Theory
Pages 1281-1315  |  DOI:10.1007/s00493-019-2429-5

Attila Joó
Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex
Pages 1317-1333  |  DOI:10.1007/s00493-019-3880-z

Daniel M. Kane, Carlo Sanna, Jeffrey Shallit
Waring’s Theorem for Binary Powers
Pages 1335-1350  |  DOI:10.1007/s00493-019-3933-3

Martin Nägele, Benny Sudakov, Rico Zenklusen
Submodular Minimization Under Congruency Constraints
Pages 1351-1386  |  DOI:10.1007/s00493-019-3900-1

Sergey Norin, Alex Scott, Paul Seymour, David R. Wood
Clustered Colouring in Minor-Closed Classes
Pages 1387-1412  |  DOI:10.1007/s00493-019-3848-z

Neil Robertson, P. D. Seymour, Robin Thomas
Girth Six Cubic Graphs Have Petersen Minors
Pages 1413-1423  |  DOI:10.1007/s00493-019-3268-0

Ferdinand Ihringer, Hajime Tanaka
The Independence Number of the Orthogonality Graph in Dimension 2k
Pages 1425-1428  |  DOI:10.1007/s00493-019-4134-9

Volume 40, Issue 1, February 2020

Robert Connelly, Steven J. Gortler, Louis Theran
Generically Globally Rigid Graphs Have Generic Universally Rigid Frameworks
Pages 1-37  |  DOI:10.1007/s00493-018-3694-4

Oliver Ebsen, Mathias Schacht
Homomorphism Thresholds for Odd Cycles
Pages 39-62  |  DOI:10.1007/s00493-019-3920-8

He Guo, Lutz Warnke
Packing Nearly Optimal Ramsey R(3,t) Graphs
Pages 63-103  |  DOI:10.1007/s00493-019-3921-7

Jie Ma, Bo Ning
Stability Results on the Circumference of a Graph
Pages 105-147  |  DOI:10.1007/s00493-019-3843-4

Volume 40, Issue 2, April 2020

Noga Alon, Mrinal Kumar, Ben Lee Volk
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
Pages 149-178  |  DOI:10.1007/s00493-019-4009-0

Peter Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller
The Satisfiability Threshold For Random Linear Equations
Pages 179-235  |  DOI:10.1007/s00493-019-3897-3

John Chiarelli, Pooya Hatami, Michael Saks
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function
Pages 237-244  |  DOI:10.1007/s00493-019-4136-7

Tali Kaufman, Izhar Oppenheim
High Order Random Walks: Beyond Spectral Gap
Pages 245-281  |  DOI:10.1007/s00493-019-3847-0

Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs
Pages 283-305  |  DOI:10.1007/s00493-019-4086-0

Volume 40, Issue 3, June 2020

Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe
A Construction for Clique-Free Pseudorandom Graphs
Pages 307-314  |  DOI:10.1007/s00493-020-4226-6

Asaf Ferber, Vishesh Jain, Benny Sudakov
Number of 1-Factorizations of Regular High-Degree Graphs
Pages 315-344  |  DOI:10.1007/s00493-019-3970-y

Alexander L. Gavrilyuk, Sho Suda, Janoš Vidali
On Tight 4-Designs in Hamming Association Schemes
Pages 345-362  |  DOI:10.1007/s00493-019-4115-z

Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems
Pages 363-403  |  DOI:10.1007/s00493-019-4084-2

Ervin Győri, Michael D. Plummer, Dong Ye, Xiaoya Zha
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps
Pages 405-433  |  DOI:10.1007/s00493-019-4042-z

Gergely Harcos, Daniel Soltész
New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs
Pages 435-454  |  DOI:10.1007/s00493-020-4204-z

Volume 40, Issue 4, August 2020

Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha R. Thomas
Simple Graph Density Inequalities with No Sum of Squares Proofs
Pages 455-471  |  DOI:10.1007/s00493-019-4124-y

Michael Chapman, Nati Linial, Yuval Peled
Expander Graphs — Both Local and Global
Pages 473-509  |  DOI:10.1007/s00493-019-4127-8

Alexander Clifton, Hao Huang
On Almost k-Covers of Hypercubes
Pages 511-526  |  DOI:10.1007/s00493-019-4221-y

Andreas F. Holmsen
Large Cliques in Hypergraphs with Forbidden Substructures
Pages 527-537  |  DOI:10.1007/s00493-019-4169-y

C. S. Karthik, Pasin Manurangsi
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
Pages 539-573  |  DOI:10.1007/s00493-019-4113-1

Paul Seymour, Sophie Spirkl
Short Directed Cycles in Bipartite Digraphs
Pages 575-599  |  DOI:10.1007/s00493-019-4065-5

Alexander Sidorenko
Weakly Norming Graphs are Edge-Transitive
Pages 601-604  |  DOI:10.1007/s00493-020-4468-3