• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 43 matches

• 1985
• 
  Ron Aharoni:
  Fractional matchings and covers in infinite hypergraphs. Comb. 5(3): 181-184 (1985)
• 
  Jürgen Bierbrauer, Albrecht Brandis:
  On generalized Ramsey numbers for trees. Comb. 5(2): 95-107 (1985)
• 
  William H. Cunningham:
  On submodular function minimization. Comb. 5(3): 185-192 (1985)
• 
  Jeremy E. Dawson:
  Decomposition of binary matroids. Comb. 5(1): 1-9 (1985)
• 
  Richard William Decker, Henry H. Glover, John Philip Huneke:
  Computing the genus of the 2-amalgamations of graphs. Comb. 5(4): 271-282 (1985)
• 
  Knut Deimer:
  A new upper bound for the length of snakes. Comb. 5(2): 109-120 (1985)
• 
  Reinhard Diestel, Rudolf Halin, Walter Vogler:
  Some remarks on universal graphs. Comb. 5(4): 283-293 (1985)
• 
  Mohamed M. El-Zahar, Paul Erdös:
  On the existence of two non-neighboring subgraphs in a graph. Comb. 5(4): 295-300 (1985)
• 
  Mohamed M. El-Zahar, Norbert Sauer:
  The chromatic number of the product of two 4-chromatic graphs is 4. Comb. 5(2): 121-126 (1985)
• 
  Konrad Engel, Nikolai N. Kuzjurin:
  About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets. Comb. 5(4): 301-309 (1985)
• 
  Péter L. Erdös, Peter Frankl, Gyula O. H. Katona:
  Extremal hypergraph problems and convex hulls. Comb. 5(1): 11-26 (1985)
• 
  Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
  Multipartite graph - space graph Ramsey numbers. Comb. 5(4): 311-318 (1985)
• 
  Hubert de Fraysseix, Pierre Rosenstiehl:
  A characterization of planar graphs by Trémaux orders. Comb. 5(2): 127-135 (1985)
• 
  Zoltán Füredi:
  Set-systems with three intersections. Comb. 5(1): 27-31 (1985)
• 
  Chris D. Godsil:
  Inverses of trees. Comb. 5(1): 33-39 (1985)
• 
  András Gyárfás, Jenö Lehel, Zsolt Tuza:
  How many atoms can be defined by boxes. Comb. 5(3): 193-204 (1985)
• 
  András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt:
  On the sum of the reciprocals of cycle lengths in sparse graphs. Comb. 5(1): 41-52 (1985)
• 
  Ervin Györi:
  Covering simply connected regions by rectangles. Comb. 5(1): 53-55 (1985)
• 
  D. J. Hajela, Paul D. Seymour:
  Counting points in hypercubes and convolution measure algebras. Comb. 5(3): 205-214 (1985)
• 
  András Hajnal:
  The chromatic number of the product of two Alef _i - Chromatic Graphs can be countable. Comb. 5(2): 137-139 (1985)
• 
  Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
  The struction of a graph: Application to CN-free graphs. Comb. 5(2): 141-147 (1985)
• 
  Melvin Hausner:
  Inclusion-exclusion inequalities. Comb. 5(3): 215-225 (1985)
• 
  Jeff Kahn:
  A problem of P. Seymour on nonbinary matroids. Comb. 5(4): 319-323 (1985)
• 
  Alexander V. Karzanov:
  Families of cuts with the MFMC-property. Comb. 5(4): 325-336 (1985)
• 
  G. Koester:
  Note to a problem of T. Gallai and G. A. Dirac. Comb. 5(3): 227-228 (1985)
• 
  János Komlós:
  Linear verification for spanning trees. Comb. 5(1): 57-65 (1985)
• 
  Alexandr V. Kostochka:
  Maximum set of edges no two covered by a clique. Comb. 5(3): 229-236 (1985)
• 
  Henry J. Landau, Benjamin F. Logan, Larry A. Shepp:
  An inequality conjectured by Hajela and Seymour arising in combinatorial geometry. Comb. 5(4): 337-342 (1985)
• 
  Bernt Lindström:
  A Desagruesian theorem for algebraic combinatorial geometries. Comb. 5(3): 237-239 (1985)
• 
  Stephen C. Locke:
  A generalization of Dirac's theorem. Comb. 5(2): 149-159 (1985)

skipping 13 more matches