default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 9
Volume 9, Number 1, 1989
- Vitaly Bergelson, Neil Hindman:
Ultrafilters and multidimensional Ramsey theorems. 1-7 - Zvi Galil, Ravi Kannan, Endre Szemerédi:
On 3-pushdown graphs with large separators. 9-19 - V. P. Grishuhin:
Cones of alternating and cut submodular set functions. 21-32 - Roland Häggkvist, Yannis Manoussakis:
Cicles and paths in bipartite tournaments with spanning configurations. 33-38 - Tomasz Luczak
, John C. Wierman:
The chromatic number of random graphs at the double jump threshold. 39-49 - T. P. McDonough, Vassili C. Mavron:
Symmetric designs and geometroids. 51-57 - Arnold Neumaier:
Duality in coherent configurations. 59-67 - James G. Oxley, Don Row:
On fixing elements in matroid minors. 69-74 - Jean-Pierre Roudneff:
Inseparability graphs of oriented matroids. 75-84 - Rodica Simion, D. S. Cao:
Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching. 85-89 - Jerzy Wojciechowski:
A new lower bound for snake-in-the-box codes. 91-99
- Ervin Györi:
On the number of C5's in a triangle-free graph. 101-102 - Igor Kríz:
A cycle-space invariant of the <2-distance-graph in the plane. 103-105 - Bernt Lindström:
Matroids algebraic over F(t) are algebraic over F. 107-110
Volume 9, Number 2, 1989
- Fan R. K. Chung, Ronald L. Graham, Michael E. Saks:
A dynamic location problem for graphs. 111-131 - Alan M. Frieze:
Survival time of a random graph. 133-143 - Winfried Hochstättler, Walter Kern:
Matroid matching in pseudomodular lattices. 145-152 - Hanno Lefmann:
An extremal problem for Graham-Rotschild parameter words. 153-160 - Tom Leighton, Peter W. Shor:
Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms. 161-187 - Emil Klafszky, Tamás Terlaky:
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids. 189-198 - Lajos Rónyai:
Factoring polynomials modulo special primes. 199-206 - A. F. Sidorenko:
Asymptotic solution for a new class of forbidden r-graphs. 207-215 - Dobromir T. Todorov:
Lower bounds for coverings of pairs by large blocks. 217-225
- Igor Kríz:
A hypergraph-free construction of highly chromatic graph without short cycles. 227-229 - Jan Reiterman:
A note on monotone paths in labeled graphs. 231-232
Volume 9, Number 3, 1989
- H. L. Abbott, Donovan R. Hare:
Sparse color-critical hypergraphs. 233-243 - Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein:
The size of chordal, interval and threshold subgraphs. 245-253 - A. V. Ivanov:
Non rank 3 strongly regular graphs with the 5-vertex condition. 255-260 - Heinz Adolf Jung, Mark E. Watkins:
The connectivities of locally finite primitive graphs. 261-267 - David Lichtenstein, Nathan Linial, Michael E. Saks:
Some extremal problems arising form discrete control processes. 269-287 - David Peleg, Eli Upfal:
Constructng disjoint paths on expander graphs. 289-313 - Lajos Rónyai, Tamás Szonyi:
Planar functions over finite fields. 315-320
Volume 9, Number 4, 1989
- Egon Balas, William R. Pulleyblank:
The perfectly matchable subgraph polytope of an arbitrary graph. 321-337 - Andries E. Brouwer, A. V. Ivanov, Mikhail H. Klin:
Some new strongly regular graphs . 339-344 - Fan R. K. Chung, Ronald L. Graham, Richard M. Wilson:
Quasi-random graphs. 345-362 - Alan M. Frieze, Colin J. H. McDiarmid:
On random minimum lenght spanning trees. 363-374 - Alexander Schrijver:
The Klein bottle and multicommodity flows. 375-384 - Gábor Tardos:
Query complexity, or why is it difficult to seperate NP A cap co NPA from PA by random oracles A?. 385-392 - Noga Alon, Michael Tarsi:
A nowhere-zero point in liner mappings. 393-396
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
