@article{Ajtai-Komlos-Szemeredi/81,
AUTHOR = {Ajtai, Mikl{\'o}s and Koml{\'o}s, J{\'a}nos and Szemer{\'e}di, Endre},
TITLE = {The longest path in a random graph},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {1-12},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Chung-Erdos-Graham/81,
AUTHOR = {Chung, F.R.K. and Erd{\H{o}}s, P. and Graham, R.L.},
TITLE = {Minimal decompositions of graphs into mutually isomorphic subgraphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {13-24},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Bell Labs., Murray Hill, NJ, USA},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Erdos/81,
AUTHOR = {Erd{\H{o}}s, P.},
TITLE = {On the combinatorial problems which I would most like to see solved},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {25-42},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Groflin-Hoffman/81,
AUTHOR = {Gr{\"o}flin, Heinz and Hoffman, Alan J.},
TITLE = {On matroid intersections},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {43-47},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Kleitman-Winston/81,
AUTHOR = {Kleitman, Daniel J. and Winston, Kenneth J.},
TITLE = {Forests and score vectors},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {49-54},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Dept. of Math., MIT, Cambridge, MA, USA},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Li-Li/81,
AUTHOR = {Li, Shuo-Yen Robert and Li, Wen-Ch'ing Winnie},
TITLE = {Independence numbers of graphs and generators of ideals},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {55-61},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Dept. of Math., Univ. of Illinois, Chicago, IL, USA},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{van_Lint-Schrijver/81,
AUTHOR = {van Lint, J.H. and Schrijver, A.},
TITLE = {Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {63-73},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Univ. of Technol., Eindhoven, Netherlands},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Seymour/81,
AUTHOR = {Seymour, P.D.},
TITLE = {Recognizing graphic matroids},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {75-78},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Merton Coll., Oxford, England},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Tutte/81a,
AUTHOR = {Tutte, W.T.},
TITLE = {Graph factors},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {79-97},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Univ. of Waterloo, Waterloo, Ontario, Canada},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Bannai-Bannai/81,
AUTHOR = {Bannai, Eiichi and Bannai, Etsuko},
TITLE = {An upper bound for the cardinality of an $s$-distance subset in real Euclidean space},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {99-102},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Dept. of Math., Ohio State Univ., Columbus, OH, USA},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Beck/81,
AUTHOR = {Beck, J{\'o}zsef},
TITLE = {van der Waerden and Ramsey type games},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {103-116},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Math. Inst., Acad. of Sci., Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Bondy-Lovasz/81,
AUTHOR = {Bondy, J.A. and Lov{\'a}sz, L.},
TITLE = {Cycles through specified vertices of a graph},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {117-140},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Univ. of Waterloo, Waterloo, Ontario, Canada},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Erdos-Fajtlowicz/81,
AUTHOR = {Erd{\H{o}}s, Paul and Fajtlowicz, Siemion},
TITLE = {On the conjecture of Haj{\'o}s},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {141-143},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Frank/81a,
AUTHOR = {Frank, Andr{\'a}s},
TITLE = {How to make a digraph strongly connected},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {145-153},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Res. Inst. for Telecommunication, Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Furedi/81,
AUTHOR = {F{\"u}redi, Zolt{\'a}n},
TITLE = {Maximum degree and fractional matchings in uniform hypergraphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {155-162},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Godsil/81a,
AUTHOR = {Godsil, C.D.},
TITLE = {Equiarboreal graphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {163-167},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Inst. f{\"u}r Math. und Angewandte Geometrie, Montanuniv. Leoben, Leoben, Austria},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Grotschel-Lovasz-Schrijver/81,
AUTHOR = {Gr{\"o}tschel, M. and Lov{\'a}sz, L. and Schrijver, A.},
TITLE = {The ellipsoid method and its consequences in combinatorial optimization},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {169-197},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Inst. f{\"u}r {\"o}konometrie und Operations Res., Univ. Bonn, Bonn, Germany},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
NOTE = {see Corrigendum in Combinatorica 4, 291-295},
}
@article{Nesetril-Rodl/81,
AUTHOR = {Ne{\v{s}}et{\v{r}}il, Jaroslav and R{\"o}dl, Vojt{\v{e}}ch},
TITLE = {Simple proof of the existence of restricted Ramsey graphs by means of a partite construction},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {199-202},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Charles Univ., Praha, Czechoslovakia},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Spencer/81,
AUTHOR = {Spencer, Joel},
TITLE = {Suresums},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {203-208},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {State Univ. of New York, Stony Brook, NY, USA},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Beck/81a,
AUTHOR = {Beck, J{\'o}zsef},
TITLE = {Balancing families of integer sequences},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {209-216},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Berge-Chen-Chvatal-Seow/81,
AUTHOR = {Berge, C. and Chen, C.C. and Chv{\'a}tal, V. and Seow, C.S.},
TITLE = {Combinatorial properties of polynominoes},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {217-224},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {CNRS, Paris, France},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Deza-Frankl/81,
AUTHOR = {Deza, M. and Frankl, P.},
TITLE = {Every large set of equidistant $(0,+1,-1)$-vectors forms a sunflower},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {225-231},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {CNRS, Paris, France},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Furedi-Komlos/81,
AUTHOR = {F{\"u}redi, Z. and Koml{\'o}s, J.},
TITLE = {The eigenvalues of random symmetric matrices},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {233-241},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Godsil/81b,
AUTHOR = {Godsil, C.D.},
TITLE = {On the full automorphism group of a graph},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {243-256},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Inst. f{\"u}r Math. und Angewandte Geometrie, Montanuniv. Leoben, Leoben, Austria},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Godsil/81c,
AUTHOR = {Godsil, C.D.},
TITLE = {Hermite polynomials and a duality relation for matchings polynomials},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {257-262},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Inst. f{\"u}r Math. und Angewandte Geometrie, Montanuniv. Leoben, Leoben, Austria},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Gyori/81,
AUTHOR = {Gy{\H{o}}ri, Ervin},
TITLE = {Partition conditions and vertex-connectivity of graphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {263-273},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Math. Inst. of Hungarian Acad. of Sci., Budapest, Hungary},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Hammer-Simeone/81,
AUTHOR = {Hammer, Peter L. and Simeone, Bruno},
TITLE = {The splittance of a graph},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {275-284},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Univ. of Waterloo, Waterloo, Canada},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Jung/81,
AUTHOR = {Jung, H.A.},
TITLE = {A note on fragments of infinite graphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {285-288},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Tech. Univ. Berlin, Fachbereich Math., Berlin, Germany},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Schellenberg-Stinson-Vanstone-Yates/81,
AUTHOR = {Schellenberg, P.J. and Stinson, D.R. and Vanstone, S.A. and Yates, J.W.},
TITLE = {The existence of Howell designs of side $n+1$ and order $2n$},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {289-301},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Univ. of Waterloo, Waterloo, Canada},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Spencer/81a,
AUTHOR = {Spencer, Joel},
TITLE = {Extremal problems, partition theorems, symmetric hypergraphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {303-307},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
INSTITUTION = {Dept. of Math., State Univ. of New York, Stony Brook, NY, USA},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Weiss/81,
AUTHOR = {Weiss, Richard},
TITLE = {The nonexistence of 8-transitive graphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {309-311},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Ajtai-Erdos-Komlos-Szemeredi/81,
AUTHOR = {Ajtai, M. and Erd{\H{o}}s, P. and Koml{\'o}s, J. and Szemer{\'e}di, E.},
TITLE = {On Tur{\'a}n's theorem for sparse graphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {313-317},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Beck/81b,
AUTHOR = {Beck, J{\'o}zsef},
TITLE = {Roth's estimate of the discrepancy of integer sequences is nearly sharp},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {319-325},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Beck/81c,
AUTHOR = {Beck, J{\'o}zsef},
TITLE = {Balanced two-colorings of finite sets in the square I},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {327-335},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Bermond-Germa-Heydemann-Sotteau/81,
AUTHOR = {Bermond, J.C. and Germa, A. and Heydemann, M.C. and Sotteau, D.},
TITLE = {Longest paths in digraphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {337-341},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Cameron/81,
AUTHOR = {Cameron, P.J.},
TITLE = {Normal subgroups of infinite multiply transitive permutation groups},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {343-347},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Fernandez_de_la_Vega-Lueker/81,
AUTHOR = {Fernandez de la Vega, W. and Lueker, G.S.},
TITLE = {Bin packing can be solved within $1+\epsilon$ in linear time},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {349-355},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Frankl-Wilson/81,
AUTHOR = {Frankl, P. and Wilson, R.M.},
TITLE = {Intersection theorems with geometric consequences},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {357-368},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Godsil/81d,
AUTHOR = {Godsil, C.D.},
TITLE = {Matching behaviour is asymptotically normal},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {369-376},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Gyori/81a,
AUTHOR = {Gy{\H{o}}ri, Ervin},
TITLE = {An $n$-dimensional search problem with restricted questions},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {377-380},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Kleitman-Shearer-Sturtevant/81,
AUTHOR = {Kleitman, D.J. and Shearer, J. and Sturtevant, D.},
TITLE = {Intersections of $k$-element sets},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {381-384},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Mader/81,
AUTHOR = {Mader, W.},
TITLE = {On a property of $n$-edge-connected digraphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {385-386},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}
@article{Seymour/81a,
AUTHOR = {Seymour, P.D.},
TITLE = {On minors of non-binary matroids},
JOURNAL = {Combinatorica},
VOLUME = {1},
PAGES = {387-394},
YEAR = {1981},
PUBLISHER = {Akad{\'e}miai Kiad{\'o}},
ADDRESS = {Budapest, North-Holland Publishing Company: Amsterdam-New York-Oxford-Tokyo},
}