default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 8
Volume 8, Number 1, 1988
- Alok Aggarwal, Richard J. Anderson:
A random NC algorithm for depth first search. 1-12 - Ron Aharoni, Paul Erdös, Nathan Linial:
Optima of dual integer linear programs. 13-20 - József Beck:
On a lattice point problem of L. Moser I. 21-47 - Béla Bollobás:
The chromatic number of random graphs. 49-55 - Andries E. Brouwer, Arnold Neumaier
:
A remark on partial linear spaces of girth 5 with an application to strongly regular graphs. 57-61 - Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara:
On multiplicative graphs and the product conjecture. 63-74 - Johan Håstad:
Dual vectors and lower bounds for the nearest lattice point problem. 75-81 - Alexandr V. Kostochka, László Pyber:
Samll topological complete subgraphs of "dense" graphs. 83-86 - Bernt Lindström:
A generalization of the Ingleton-Main lemma and a class of non-algebraic matroids. 87-90 - Nathan Linial, László Lovász, Avi Wigderson:
Rubber bands, convex embeddings and graph connectivity. 91-102 - András Sebö:
The Schrijver system of odd join polyhedra. 103-116 - Micha Sharir:
Improved lower bounds on the length of Davenport - Schinzel sequences. 117-124 - Paul M. Terwilliger:
The classification of distance-regular graphs of type IIB. 125-132
- László Babai:
A short proof of the non-uniform Ray Chauhuri - Wilson inequality. 133-135 - Branko Grünbaum:
The edge-density of 4-critical planar graphs. 137-139 - Éva Tardos:
The gap between monotone and non-monotone circuit complexity is exponential. 141-142
Volume 8, Number 2, 1988
- Martin Aigner, D. Grieser:
Hook-free coloring and a problem of Hanson. 143-148 - Hans-Jürgen Bandelt:
Hereditary modular graphs. 149-157 - József Beck:
On a lattice point problem of L. Moser II. 159-176 - Zhanna A. Chernyak, Arkady A. Chernyak:
Matrices with prescribed row, column and sums. 177-184 - Joel Friedman:
A lower bound on strictly non-block networks. 185-188 - Zvi Galil, Victor Y. Pan:
Improved processor bounds for combinatorial problems in RNC. 189-200 - János Kincses:
How big can the circuits of a bridge of a maximal circuit be? 201-205 - Mieko Yamada:
On a relation between a cyclic relative difference set associated with the quadratic extensions of a finite field and the Szekeres differences sets. 207-216 - Günter M. Ziegler:
Branchings in rooted graphs and the diameter of greedoids. 217-234
Volume 8, Number 3, 1988
- Miklós Ajtai:
A lower bound for finding predecessors in Yao's call probe model. 235-247 - Peter J. Cameron, Michel Deza, Peter Frankl:
Intersection theorems in permutation groups. 249-260 - Alexander Lubotzky, Ralph Phillips, Peter Sarnak:
Ramanujan graphs. 261-277 - Andrzej Rucinski, Andrew Vince:
Balanced extensions of graphs and hypergraphs. 279-291
- William I. Chang, Eugene L. Lawler:
Edge coloring of hypergraphs and a conjecture of Erdös, Faber, Lovász. 293-295
Volume 8, Number 4, 1988
- Noga Alon, Gregory Freiman:
On sums of subsets of a set of integers. 297-306 - Norman Biggs:
Girth and residual finiteness. 307-312 - Paul A. Catlin:
Contractions of graphs with no spanning eulerian subgraphs. 313-321 - Peter Frankl, Vojtech Rödl:
Some Ramsey - Turán type results for hypergraphs. 323-332 - Chris D. Godsil:
Bouding the diameter of distance-regular graphs. 333-344 - Ljuben R. Mutafchiev:
Limit theorem concerning random mapping patterns. 345-356 - Edward R. Scheinerman:
Random interval graphs. 357-371 - Donald K. Wagner:
Equivalent factor matroids of graphs. 372-377
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-01-08 20:20 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:
