László Lovász and his mathematics (The 2021 Abel Prize)

Jaroslav Nešetřil

Pokroky matematiky, fyziky a astronomie (2021)

  • Volume: 66, Issue: 3, page 157-167
  • ISSN: 0032-2423

Abstract

top
Tento článek je napsán u příležitosti udělení Abelovy ceny za rok 2021 László Lovászovi.

How to cite

top

Nešetřil, Jaroslav. "László Lovász a jeho matematika (Abelova cena za rok 2021)." Pokroky matematiky, fyziky a astronomie 66.3 (2021): 157-167. <http://eudml.org/doc/298123>.

@article{Nešetřil2021,
abstract = {Tento článek je napsán u příležitosti udělení Abelovy ceny za rok 2021 László Lovászovi.},
author = {Nešetřil, Jaroslav},
journal = {Pokroky matematiky, fyziky a astronomie},
language = {cze},
number = {3},
pages = {157-167},
publisher = {Jednota českých matematiků a fyziků},
title = {László Lovász a jeho matematika (Abelova cena za rok 2021)},
url = {http://eudml.org/doc/298123},
volume = {66},
year = {2021},
}

TY - JOUR
AU - Nešetřil, Jaroslav
TI - László Lovász a jeho matematika (Abelova cena za rok 2021)
JO - Pokroky matematiky, fyziky a astronomie
PY - 2021
PB - Jednota českých matematiků a fyziků
VL - 66
IS - 3
SP - 157
EP - 167
AB - Tento článek je napsán u příležitosti udělení Abelovy ceny za rok 2021 László Lovászovi.
LA - cze
UR - http://eudml.org/doc/298123
ER -

References

top
  1. Aigner, M., Ziegler, G., Proofs from THE BOOK, . Springer, 1998. (1998) Zbl0905.00001
  2. Alon, N., Kříž, I., Nešetřil, J., How to color shift hypergraphs, . Stud. Sci. Math. Hungar. 30 (1995), 1–11. (1995) 
  3. Bernshteyn, A., 10.1016/j.aim.2019.06.031, . Adv. Math. 353 (2019), 153–223. (2019) DOI10.1016/j.aim.2019.06.031
  4. Borgs, Ch., Chayes, J., Lovász, L., Sós, V. T., Vesztergombi, K., Counting graph homomorphisms, . In: Klazar, M., Kratochvíl, J., Loebl, M., Matoušek, J., Valtr, P., Thomas, R. (eds.): Topics in discrete mathematics, Springer, 2006, 315–371. (2006) 
  5. Erdős, P., Lovász, L., Problems and results on 3-chromatic hypergraphs and some related questions, . In: Infinite and finite sets, Colloquia Mathematica Societatis János Bolyai 10, North-Holland, 1975, 609–627. (1975) 
  6. Freedman, M., Lovász, L., Schrijver, L., 10.1090/S0894-0347-06-00529-7, . J. Amer. Math. Soc. 20 (2007), 37–51. (2007) DOI10.1090/S0894-0347-06-00529-7
  7. Graham, R. L., Grötschel, M., Lovász, L., Handbook of combinatorics, . Elsevier, 1995. (1995) 
  8. Grötschel, M., Lovász, L., Schrijver, A., Geometric algorithms and combinatorial optimization, . Springer, 1988. (1988) 
  9. Hell, P., Nešetřil, J., Graphs and homomorphisms, . Oxford University Press, 2006. (2006) 
  10. Hoory, S., Linial, N., Wigderson, A., 10.1090/S0273-0979-06-01126-8, . Bull. Amer. Math. Soc. 43 (2006), 439–561. (2006) DOI10.1090/S0273-0979-06-01126-8
  11. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R., 10.4007/annals.2006.164.51, . Ann. of Math. 164 (2006), 51–229. (2006) DOI10.4007/annals.2006.164.51
  12. Lenstra, A. K., Lenstra, A. W., Lovász, L., 10.1007/BF01457454, . Math. Ann. 261 (1982), 515–534. (1982) DOI10.1007/BF01457454
  13. Lovász, L., 10.1007/BF02280291, . Acta Math. Hungar. 18 (1967), 321–328. (1967) DOI10.1007/BF02280291
  14. Lovász, L., 10.1007/BF01894680, . Acta Math. Hungar. 19 (1968), 59–67. (1968) DOI10.1007/BF01894680
  15. Lovász, L., 10.1007/BF02029172, . Period. Math. Hungar. 1 (1971), 145–156. (1971) DOI10.1007/BF02029172
  16. Lovász, L., 10.1016/0095-8956(72)90045-7, . J. Combin. Theory Ser. B 13 (1972), 95–98. (1972) DOI10.1016/0095-8956(72)90045-7
  17. Lovász, L., 10.1016/0095-8956(72)90068-8, . J. Combin. Theory Ser. B 13 (1972), 309–310. (1972) DOI10.1016/0095-8956(72)90068-8
  18. Lovász, L., Flats in matroids and geometric graphs, . In: Combinatorial Surveys, Proc. 6th British Comb. Conf., Academic Press, 1977, 45–86. (1977) 
  19. Lovász, L., 10.1016/0097-3165(78)90022-5, . J. Combin. Theory Ser. A 25 (1978), 319–324. (1978) DOI10.1016/0097-3165(78)90022-5
  20. Lovász, L., Combinatorial problems and exercises, . North-Holland, 1979. (1979) 
  21. Lovász, L., 10.1109/TIT.1979.1055985, . IEEE Trans. Inform. Theory 25 (1979), 1–7. (1979) DOI10.1109/TIT.1979.1055985
  22. Lovász, L., Large networks and graph limits, . American Mathematical Society, 2012. (2012) 
  23. Lovász, L., Graphs and geometry, . American Mathematical Society, 2019. (2019) 
  24. Lovász, L., Nešetřil, J., Pultr, A., 10.1016/0095-8956(80)90043-X, . J. Combin. Theory Ser. B 29 (1980), 47–67. (1980) DOI10.1016/0095-8956(80)90043-X
  25. Lovász, L., Plummer, M., Matching theory, . North-Holland, 1986. (1986) 
  26. Lovász, L., Szegedy, M., 10.1007/s00039-007-0599-6, . Geom. Funct. Anal. 17 (2007), 252–270. (2007) DOI10.1007/s00039-007-0599-6
  27. Matoušek, J., Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry., Springer, 2003. (2003) 
  28. Matoušek, J., Thirty-three miniatures. Mathematical and algorithmic applications of linear algebra, . American Mathematical Society, 2010. (2010) 
  29. Müller, V., 10.1016/0095-8956(77)90074-0, . J. Combin. Theory Ser. B 22 (1977), 281–283. (1977) DOI10.1016/0095-8956(77)90074-0
  30. Nešetřil, J., A combinatorial classic – sparse graphs with high chromatic number, . In: Lovász, L., Ruzsa, I. Z., Sós, V. T. (eds.): Erdős centennial, Springer, 2013, 383–407. (2013) 
  31. Odlyzko, A. M., te Riele, H. J. J., Disproof of the Mertens conjecture, . J. Reine Angew. Math. 357 (1985), 138–160. (1985) 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.