References
D. Borwein,unpublished.
P. Erdős andT. Grünwald, On polynomials with only real roots,Annals of Math. 40 (1939) 437–458.
P. Erdős andT. Gallai, On minimal paths and circuits of graphs,Acta Math. Acad. Sci. Hung. 10 (1959) 337–356.
P. Erdős andT. Gallai, Graphs with prescribed degrees of vertices (in Hungarian),Matematikai Lapok 11 (1960) 264–274.
P. Erdős andT. Gallai, On the minimal number of vertices representing the edges of a graph,Publ. Math. Inst. Hung. Acad. Sci. 6A (1961) 181–203.
P. Erdős andT. Gallai, Solution of a problem of Dirac,Theory of graphs and its applications (ed. M. Fiedler),Proc. Coll. Smolenice, 1964, 167–168.
P. Erdős, T. Gallai andE. Vázsonyi, Über Euler-Linien unendlicher Graphen,Journ. of Math. and Phys. 17 (1938) 59–75.
P. Erdős, A. Hajnal andJ. W. Moon, A problem in graph theory,Amer. Math. Monthly,71 (1964) 1107–1110.
P. Erdős andL. Pósa, On independent circuits contained in a graph,Canad. Journ. Math. 17 (1965) 347–352.
B. Grünbaum,Arrangements and spreads, Amer. Math. Soc., Providence, 1972.
T. Grünwald, On polynomials with real roots (in Hungarian, with German summary)Mat, és Fiz. Lapok 46 (1939) 31–57.
L. Lovász,Combinatorial problems and exercises, Akadémiai Kiadó/North-Holland, 1979.
Th. Motzkin, The lines and planes connecting the points of a finite set,Trans. Amer. Math. Soc. 70 (1951) 451–464.
Rights and permissions
About this article
Cite this article
Erdős, P. Personal reminiscences and remarks on the mathematical work of Tibor Gallai. Combinatorica 2, 207–212 (1982). https://doi.org/10.1007/BF02579228
Issue Date:
DOI: https://doi.org/10.1007/BF02579228