Geodesic
László Lovász a jeho matematika (Abelova cena za rok 2021)
Pokroky matematiky, fyziky a astronomie, Tome 66 (2021) no. 3, pp. 157-167
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Tento článek je napsán u příležitosti udělení Abelovy ceny za rok 2021 László Lovászovi.
Tento článek je napsán u příležitosti udělení Abelovy ceny za rok 2021 László Lovászovi.
Classification : 01A70, 68-xx 
@article{PMFA_2021_66_3_a1,
     author = {Ne\v{s}et\v{r}il, Jaroslav},
     title = {L\'aszl\'o {Lov\'asz} a jeho matematika {(Abelova} cena za rok 2021)},
     journal = {Pokroky matematiky, fyziky a astronomie},
     pages = {157--167},
     year = {2021},
     volume = {66},
     number = {3},
     zbl = {07675627},
     language = {cs},
     url = {http://geodesic.mathdoc.fr/item/PMFA_2021_66_3_a1/}
}
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
SP  - 157
EP  - 167
VL  - 66
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/PMFA_2021_66_3_a1/
LA  - cs
ID  - PMFA_2021_66_3_a1
ER  - 
%0 Journal Article
%A Nešetřil, Jaroslav
%T László Lovász a jeho matematika (Abelova cena za rok 2021)
%J Pokroky matematiky, fyziky a astronomie
%D 2021
%P 157-167
%V 66
%N 3
%U http://geodesic.mathdoc.fr/item/PMFA_2021_66_3_a1/
%G cs
%F PMFA_2021_66_3_a1
Nešetřil, Jaroslav. László Lovász a jeho matematika (Abelova cena za rok 2021). Pokroky matematiky, fyziky a astronomie, Tome 66 (2021) no. 3, pp. 157-167. http://geodesic.mathdoc.fr/item/PMFA_2021_66_3_a1/

[1] Aigner, M., Ziegler, G.: Proofs from THE BOOK. Springer, 1998. | Zbl

[2] Alon, N., Kříž, I., Nešetřil, J.: How to color shift hypergraphs. Stud. Sci. Math. Hungar. 30 (1995), 1–11.

[3] Bernshteyn, A.: Measurable versions of the Lovász local lemma and measurable graph colorings. Adv. Math. 353 (2019), 153–223. | DOI | MR

[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. | MR

[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.

[6] Freedman, M., Lovász, L., Schrijver, L.: Reflection positivity, rank connectivity, and homomorphism of graphs. J. Amer. Math. Soc. 20 (2007), 37–51. | DOI | MR

[7] Graham, R. L., Grötschel, M., Lovász, L.: Handbook of combinatorics. Elsevier, 1995.

[8] Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, 1988.

[9] Hell, P., Nešetřil, J.: Graphs and homomorphisms. Oxford University Press, 2006. | MR

[10] Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc. 43 (2006), 439–561. | DOI | MR

[11] Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. of Math. 164 (2006), 51–229. | DOI | MR

[12] Lenstra, A. K., Lenstra, A. W., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 261 (1982), 515–534. | DOI

[13] Lovász, L.: Operations with structures. Acta Math. Hungar. 18 (1967), 321–328. | DOI

[14] Lovász, L.: On chromatic number of graphs and set systems. Acta Math. Hungar. 19 (1968), 59–67. | DOI

[15] Lovász, L.: On the cancellation law among finite relational structures. Period. Math. Hungar. 1 (1971), 145–156. | DOI

[16] Lovász, L.: A characterization of perfect graphs. J. Combin. Theory Ser. B 13 (1972), 95–98. | DOI

[17] Lovász, L.: A note on the line reconstruction problem. J. Combin. Theory Ser. B 13 (1972), 309–310. | DOI

[18] Lovász, L.: Flats in matroids and geometric graphs. In: Combinatorial Surveys, Proc. 6th British Comb. Conf., Academic Press, 1977, 45–86.

[19] Lovász, L.: Kneser’s conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A 25 (1978), 319–324. | DOI

[20] Lovász, L.: Combinatorial problems and exercises. North-Holland, 1979.

[21] Lovász, L.: On the Shannon capacity of graphs. IEEE Trans. Inform. Theory 25 (1979), 1–7. | DOI

[22] Lovász, L.: Large networks and graph limits. American Mathematical Society, 2012. | MR

[23] Lovász, L.: Graphs and geometry. American Mathematical Society, 2019. | MR

[24] Lovász, L., Nešetřil, J., Pultr, A.: On a product dimension of graphs. J. Combin. Theory Ser. B 29 (1980), 47–67. | DOI

[25] Lovász, L., Plummer, M.: Matching theory. North-Holland, 1986.

[26] Lovász, L., Szegedy, M.: Szemerédi’s lemma for the analyst. Geom. Funct. Anal. 17 (2007), 252–270. | DOI | MR

[27] Matoušek, J.: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Springer, 2003. | MR

[28] Matoušek, J.: Thirty-three miniatures. Mathematical and algorithmic applications of linear algebra. American Mathematical Society, 2010. | MR

[29] Müller, V.: The edge reconstruction hypothesis is true for graphs with more than $n\cdot \log n$ edges. J. Combin. Theory Ser. B 22 (1977), 281–283. | DOI

[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. | MR

[31] Odlyzko, A. M., te Riele, H. J. J.: Disproof of the Mertens conjecture. J. Reine Angew. Math. 357 (1985), 138–160.