Combinatorica, Volume 9

Volume 9, Number 1, 1989

Vitaly Bergelson, Neil Hindman: Ultrafilters and multidimensional Ramsey theorems. 1-7 BibTeX
Zvi Galil, Ravi Kannan, Endre Szemerédi: On 3-pushdown graphs with large separators. 9-19 BibTeX
V. P. Grishuhin: Cones of alternating and cut submodular set functions. 21-32 BibTeX
Roland Häggkvist, Yannis Manoussakis: Cicles and paths in bipartite tournaments with spanning configurations. 33-38 BibTeX
Tomasz Luczak, John C. Wierman: The chromatic number of random graphs at the double jump threshold. 39-49 BibTeX
T. P. McDonough, Vassili C. Mavron: Symmetric designs and geometroids. 51-57 BibTeX
Arnold Neumaier: Duality in coherent configurations. 59-67 BibTeX
James G. Oxley, Don Row: On fixing elements in matroid minors. 69-74 BibTeX
Jean-Pierre Roudneff: Inseparability graphs of oriented matroids. 75-84 BibTeX
Rodica Simion, D. S. Cao: Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching. 85-89 BibTeX
Jerzy Wojciechowski: A new lower bound for snake-in-the-box codes. 91-99 BibTeX

Note

Ervin Györi: On the number of C₅'s in a triangle-free graph. 101-102 BibTeX
Igor Kríz: A cycle-space invariant of the <2-distance-graph in the plane. 103-105 BibTeX
Bernt Lindström: Matroids algebraic over F(t) are algebraic over F. 107-110 BibTeX

Fan R. K. Chung, Ronald L. Graham, Michael E. Saks: A dynamic location problem for graphs. 111-131 BibTeX
Alan M. Frieze: Survival time of a random graph. 133-143 BibTeX
Winfried Hochstättler, Walter Kern: Matroid matching in pseudomodular lattices. 145-152 BibTeX
Hanno Lefmann: An extremal problem for Graham-Rotschild parameter words. 153-160 BibTeX
Tom Leighton, Peter W. Shor: Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms. 161-187 BibTeX
Emil Klafszky, Terlaky Terlaky: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids. 189-198 BibTeX
Lajos Rónyai: Factoring polynomials modulo special primes. 199-206 BibTeX
A. F. Sidorenko: Asymptotic solution for a new class of forbidden r-graphs. 207-215 BibTeX
Dobromir T. Todorov: Lower bounds for coverings of pairs by large blocks. 217-225 BibTeX

Notes

Igor Kríz: A hypergraph-free construction of highly chromatic graph without short cycles. 227-229 BibTeX
Jan Reiterman: A note on monotone paths in labeled graphs. 231-232 BibTeX

H. L. Abbott, D. R. Hare: Sparse color-critical hypergraphs. 233-243 BibTeX
Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein: The size of chordal, interval and threshold subgraphs. 245-253 BibTeX
A. V. Ivanov: Non rank 3 strongly regular graphs with the 5-vertex condition. 255-260 BibTeX
Heinz Adolf Jung, Mark E. Watkins: The connectivities of locally finite primitive graphs. 261-267 BibTeX
David Lichtenstein, Nathan Linial, Michael E. Saks: Some extremal problems arising form discrete control processes. 269-287 BibTeX
David Peleg, Eli Upfal: Constructng disjoint paths on expander graphs. 289-313 BibTeX
Lajos Rónyai, Tamás Szonyi: Planar functions over finite fields. 315-320 BibTeX

Egon Balas, William R. Pulleyblank: The perfectly matchable subgraph polytope of an arbitrary graph. 321-337 BibTeX
Andries E. Brouwer, A. V. Ivanov, Mikhail H. Klin: Some new strongly regular graphs . 339-344 BibTeX
Fan R. K. Chung, Ronald L. Graham, Richard M. Wilson: Quasi-random graphs. 345-362 BibTeX
Alan M. Frieze, Colin J. H. McDiarmid: On random minimum lenght spanning trees. 363-374 BibTeX
Alexander Schrijver: The Klein bottle and multicommodity flows. 375-384 BibTeX
Gábor Tardos: Query complexity, or why is it difficult to seperate NP ^A cap co NP^A from P^A by random oracles A?. 385-392 BibTeX
Noga Alon, Michael Tarsi: A nowhere-zero point in liner mappings. 393-396 BibTeX