Normal hypergraphs and the perfect graph conjecture. Discrete Mathematics2: 253-267.
1975年
Problems and results on 3-chromatic hypergraphs and some related questions(Erdős, P. and Lovász, L.). in Infinite and Finite Sets, Colloquia Mathematica Societatis János Bolyai11, 609-627.
1979年
On the Shannon capacity of graphs. IEEE Transactions on Information Society25: 1-7.
1981年
The ellipsoid method and its consequences in combinatorial optimization (Grötschel , M., Lovász, L., and Schrijver, A). Combinatorica1: 169-197.
1982年
Factoring polynomials with rational coefficients (Lenstra, A. K., Lenstra, H.W., and Lovász, L.) Mathematische Annalen261: 515-534.
1996年
Interactive proofs and the hardness of approximating cliques (Feige, U., Goldwasser, S., Lovász, L., Safra, S., and Szegedy, M.) Journal of the ACM43: 268-292.