Journals in DBLP
Combinatorica 1981, volume: 1, number: 4
Miklós Ajtai , Paul Erdös , János Komlós , Endre Szemerédi On Turáns theorem for sparse graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:313-317 [Journal ] József Beck Roth's estimate of the discrepancy of integer sequences is nearly sharp. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:319-325 [Journal ] József Beck Balanced two-colorings of finite sets in the square I. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:327-335 [Journal ] Jean-Claude Bermond , Anne Germa , Marie-Claude Heydemann , Dominique Sotteau Longest paths in digraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:337-341 [Journal ] Peter J. Cameron Normal subgroups of infinite multiply transitive permutation groups. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:343-347 [Journal ] Wenceslas Fernandez de la Vega , George S. Lueker Bin packing can be solved within 1+epsilon in linear time. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:349-355 [Journal ] Peter Frankl , Richard M. Wilson Intersection theorems with geometric consequences. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:357-368 [Journal ] C. D. Godsil Matching behaviour is asymptotically normal. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:369-376 [Journal ] Ervin Györi An n-dimensional search problem with restricted questions. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:377-380 [Journal ] Daniel J. Kleitman , James B. Shearer , Dean Sturtevant Intersections of k-element sets. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:381-384 [Journal ] Wolfgang Mader On a property of n-edge-connected digraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:385-386 [Journal ] Paul D. Seymour On minors of non-binary matroids. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:4, pp:387-394 [Journal ]