Combinatorica, Volume 5

Volume 5, Number 1, 1985

Jeremy E. Dawson: Decomposition of binary matroids. 1-9 BibTeX
Péter L. Erdös, Peter Frankl, Gyula O. H. Katona: Extremal hypergraph problems and convex hulls. 11-26 BibTeX
Zoltán Füredi: Set-systems with three intersections. 27-31 BibTeX
C. D. Godsil: Inverses of trees. 33-39 BibTeX
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. 41-52 BibTeX
Ervin Györi: Covering simply connected regions by rectangles. 53-55 BibTeX
János Komlós: Linear verification for spanning trees. 57-65 BibTeX
László Pyber: An Erdös - Gallai conjecture. 67-79 BibTeX
Jeanette P. Schmidt, Eli Shamir: Component structure in the evolution of random hypergraphs. 81-94 BibTeX

Jürgen Bierbrauer, Albrecht Brandis: On generalized Ramsey numbers for trees. 95-107 BibTeX
Knut Deimer: A new upper bound for the length of snakes. 109-120 BibTeX
Mohamed M. El-Zahar, Norbert Sauer: The chromatic number of the product of two 4-chromatic graphs is 4. 121-126 BibTeX
Hubert de Fraysseix, Pierre Rosenstiehl: A characterization of planar graphs by Trémaux orders. 127-135 BibTeX
András Hajnal: The chromatic number of the product of two Alef _i - Chromatic Graphs can be countable. 137-139 BibTeX
Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra: The struction of a graph: Application to CN-free graphs. 141-147 BibTeX
Stephen C. Locke: A generalization of Dirac's theorem. 149-159 BibTeX
Wolfgang Mader: Degree and local connectivity in digraphs. 161-165 BibTeX
B. L. Rothschild, Ernst G. Straus: On triangulations of the convex hull of n points. 167-179 BibTeX

Ron Aharoni: Fractional matchings and covers in infinite hypergraphs. 181-184 BibTeX
William H. Cunningham: On submodular function minimization. 185-192 BibTeX
András Gyárfás, Jenö Lehel, Zsolt Tuza: How many atoms can be defined by boxes. 193-204 BibTeX
D. J. Hajela, Paul D. Seymour: Counting points in hypercubes and convolution measure algebras. 205-214 BibTeX
Melvin Hausner: Inclusion-exclusion inequalities. 215-225 BibTeX
G. Koester: Note to a problem of T. Gallai and G. A. Dirac. 227-228 BibTeX
Alexandr V. Kostochka: Maximum set of edges no two covered by a clique. 229-236 BibTeX
Bernt Lindström: A Desagruesian theorem for algebraic combinatorial geometries. 237-239 BibTeX
James B. Shearer: On a problem of spencer. 241-245 BibTeX
Éva Tardos: A strongly polynomial minimum cost circulation algorithm. 247-256 BibTeX
Andrew Vince, Michelle L. Wachs: A shellable poset that is not lexicographically shellable. 257-260 BibTeX
Heinz-Jürgen Voss: Independent sets in k-chromatic graphs. 261-269 BibTeX

R. W. Decker, H. H. Glover, L. P. Huneke: Computing the genus of the 2-amalgamations of graphs. 271-282 BibTeX
Reinhard Diestel, Rudolf Halin, Walter Vogler: Some remarks on universal graphs. 283-293 BibTeX
Mohamed M. El-Zahar, Paul Erdös: On the existence of two non-neighboring subgraphs in a graph. 295-300 BibTeX
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. 301-309 BibTeX
Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp: Multipartite graph - space graph Ramsey numbers. 311-318 BibTeX
Jeff Kahn: A problem of P. Seymour on nonbinary matroids. 319-323 BibTeX
Alexander V. Karzanov: Families of cuts with the MFMC-property. 325-336 BibTeX
H. J. Landau, B. F. Logan, Larry A. Shepp: An inequality conjectured by Hajela and Seymour arising in combinatorial geometry. 337-342 BibTeX
James G. Oxley: Proof of a conjecture of Kahn for non-binary matroids. 343-345 BibTeX
László Pyber: Regular subgraphs of dense graphs. 347-349 BibTeX
S. S. Shrikhande, N. M. Singhi: On a problem of Erdös and Larson. 351-358 BibTeX
K. Steffens: Maximal tight sets and the Edmonds - Gallai decomposition for matchings. 359-365 BibTeX
Robert Endre Tarjan: Sequential access in play trees takes linear time. 367-378 BibTeX