• 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 44 matches

• 1982
• 
  Miklós Ajtai, János Komlós, Endre Szemerédi:
  Largest random component of a k-cube. Comb. 2(1): 1-7 (1982)
• 
  Ronald D. Baker:
  Symmetric designs with Bruck subdesigns. Comb. 2(2): 103-109 (1982)
• 
  József Beck:
  Irregularities of two-colourings of the NxN square lattice. Comb. 2(2): 111-123 (1982)
• 
  Claude Berge:
  Diperfect graphs. Comb. 2(3): 213-222 (1982)
• 
  Béla Bollobás:
  Long paths in sparse random graphs. Comb. 2(3): 223-228 (1982)
• 
  Béla Bollobás, Wenceslas Fernandez de la Vega:
  The diameter of random regular graphs. Comb. 2(2): 125-134 (1982)
• 
  Andries E. Brouwer:
  The uniqueness of the near hexagon on 729 points. Comb. 2(4): 333-340 (1982)
• 
  François Bry, Michel Las Vergnas:
  The Edmonds - Gallai decomposition for matchings in locally finite graphs. Comb. 2(3): 229-235 (1982)
• 
  Peter J. Cameron:
  There are only finitely many finite distance-transitive graphs of given valency greater than two. Comb. 2(1): 9-13 (1982)
• 
  Raul Cordovil:
  On Reid's 3-simplicial matroid theorem. Comb. 2(2): 135-141 (1982)
• 
  Ludwig Danzer, Branko Grünbaum:
  Intersection properties of boxes in R^d. Comb. 2(3): 237-246 (1982)
• 
  Michel Deza, Peter Frankl:
  On the vector space of 0-configurations. Comb. 2(4): 341-345 (1982)
• 
  M. J. Dunwoody:
  Cutting up graphs. Comb. 2(1): 15-23 (1982)
• 
  Jack Edmonds, László Lovász, William R. Pulleyblank:
  Brick decompositions and the matching rank of graphs. Comb. 2(3): 247-274 (1982)
• 
  Paul Erdös:
  Personal reminiscences and remarks on the mathematical work of Tibor Gallai. Comb. 2(3): 207-212 (1982)
• 
  Paul Erdös, Miklós Simonovits:
  Compactness results in extremal graph theory. Comb. 2(3): 275-288 (1982)
• 
  Paul Erdös, Vera T. Sós:
  On Ramsey - Turán type theorems for hypergraphs. Comb. 2(3): 289-295 (1982)
• 
  Trevor I. Fenner, Alan M. Frieze:
  On the connectivity of random m-orientable graphs and digraphs. Comb. 2(4): 347-359 (1982)
• 
  András Frank:
  Disjoint paths in a rectilinear grid. Comb. 2(4): 361-371 (1982)
• 
  Hans-Dietrich O. F. Gronau:
  On Sperner families in which no k sets have an empty intersection III. Comb. 2(1): 25-36 (1982)
• 
  Rudolf Halin:
  Some remarks on interval graphs. Comb. 2(3): 297-304 (1982)
• 
  Yahya Ould Hamidoune:
  A note on the girth of digraphs. Comb. 2(2): 143-147 (1982)
• 
  Robert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans:
  On 3-skein isomorphisms of graphs. Comb. 2(4): 373-376 (1982)
• 
  Anthony J. W. Hilton:
  Canonical edge-colourings of locally finite graphs. Comb. 2(1): 37-51 (1982)
• 
  Derek A. Holton, Charles H. C. Little:
  Regular odd rings and non-planar graphs. Comb. 2(2): 149-152 (1982)
• 
  Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen:
  A nine point theorem for 3-connected graphs. Comb. 2(1): 53-62 (1982)
• 
  Ferenc Juhász:
  The asymptotic behaviour of Lovász' theta-function for random graphs. Comb. 2(2): 153-155 (1982)
• 
  R. Kemp:
  On the average oscillation of a stack. Comb. 2(2): 157-176 (1982)
• 
  Peter Kirschenhofer, Helmut Prodinger:
  On the average hyperoscillations of planted plane trees. Comb. 2(2): 177-186 (1982)
• 
  Alexandr V. Kostochka:
  A class of constructions for Turán's (3, 4) problem. Comb. 2(2): 187-192 (1982)

skipping 14 more matches