• Thumbnail for Jaroslav Nešetřil
    Jaroslav "Jarik" Nešetřil (Czech pronunciation: [ˈjaroslaf ˈnɛʃɛtr̝̊ɪl]; born March 13, 1946) is a Czech mathematician, working at Charles University...
    9 KB (726 words) - 23:24, 31 August 2024
  • tennis player Jaroslav Mostecký (1963–2020), Czech fantasy writer Jaroslav Naď, Slovak politician Jaroslav Nešetřil, Czech mathematician Jaroslav Pelikan,...
    2 KB (283 words) - 16:24, 2 November 2023
  • Yaroslav (section Jaroslav)
    player Jaroslav Modrý, former Czech ice hockey player Jaroslav Nešetřil, Czech mathematician Jaroslav Pelikan, American Christian scholar Jaroslav Pospíšil...
    4 KB (541 words) - 12:57, 25 June 2024
  • Thumbnail for Graph homomorphism
    48 (1): 92–110, doi:10.1016/0095-8956(90)90132-J Hell & Nešetřil 2004, §5.3. Hell & Nešetřil 2004, Theorem 5.14. Feder, Tomás; Vardi, Moshe Y. (1998)...
    38 KB (4,860 words) - 02:17, 6 September 2024
  • (Ronald Graham and Jaroslav Nešetřil, eds., 1997, vol. 13) The Mathematics of Paul Erdős II (Ronald Graham and Jaroslav Nešetřil, eds., 1997, vol. 14)...
    4 KB (529 words) - 18:18, 5 July 2024
  • 2 (*)  ; evaluates to 1 Iterated binary operation Empty function Jaroslav Nešetřil, Jiří Matoušek (1998). Invitation to Discrete Mathematics. Oxford...
    10 KB (1,469 words) - 11:44, 24 October 2024
  • Thumbnail for Minimum spanning tree
    Problem (translation of both 1926 papers, comments, history) (2000) Jaroslav Nešetřil, Eva Milková, Helena Nesetrilová. (Section 7 gives his algorithm,...
    44 KB (5,460 words) - 21:16, 9 October 2024
  • long-term collaborator Jaroslav Nešetřil, and many highly cited papers, including "On the complexity of H-coloring" also with Nešetřil, "On the history of...
    4 KB (385 words) - 15:24, 23 March 2024
  • Czechoslovakia (now the Czech Republic), under the supervision of Jaroslav Nešetřil. He joined the faculty at Georgia Tech in 1989, and became a Regents'...
    6 KB (416 words) - 02:15, 20 November 2024
  • Thumbnail for Charles University
    literary theorist, linguist Alois Musil – orientalist Milan Nakonečný Jaroslav Nešetřil – mathematician Jan Patočka – philosopher Josef Ladislav Píč Petr...
    63 KB (5,206 words) - 10:40, 16 November 2024
  • Thumbnail for Ronald Graham
    V2. The mathematics of Paul Erdős. Edited with Jaroslav Nešetřil. 2 volumes. Springer, 1997; 2nd ed., 2013....
    52 KB (4,476 words) - 02:24, 21 November 2024
  • Pavol; Nešetřil, Jaroslav (1992), "The core of a graph", Discrete Mathematics, 109 (1–3): 117–126, doi:10.1016/0012-365X(92)90282-K, MR 1192374. Nešetřil, Jaroslav;...
    3 KB (399 words) - 10:41, 13 October 2022
  • Thumbnail for Emanuel Lasker
    Nowakowski, Bruce M. Landman, Florian Luca, Melvyn B. Nathanson, Jaroslav Nešetřil, and Aaron Robertson (Eds.) Combinatorial Game Theory, De Gruyter...
    112 KB (10,749 words) - 03:22, 13 November 2024
  • Thumbnail for Jan Kratochvíl
    degree in 1983 and a Ph.D. in 1987; his dissertation, supervised by Jaroslav Nešetřil, combined graph theory with coding theory. He remained at Charles...
    3 KB (201 words) - 03:24, 25 March 2023
  • Thumbnail for List of people by Erdős number
    Shlomo Moran Leo Moser M. Ram Murty V. Kumar Murty Melvyn B. Nathanson Jaroslav Nešetřil Elisha Netanyahu Donald J. Newman Jean-Louis Nicolas Ivan M. Niven...
    60 KB (5,797 words) - 08:03, 21 November 2024
  • Object-Oriented Design Patterns in C++, John Wiley & Sons, ISBN 0-471-24134-2. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2010), "From Sparse Graphs to Nowhere...
    9 KB (1,166 words) - 06:11, 25 March 2024
  • Thumbnail for Jiří Matoušek (mathematician)
    Jiří Matoušek (Q472657). Invitation to Discrete Mathematics (with Jaroslav Nešetřil). Oxford University Press, 1998. ISBN 978-0-19-850207-4. Translated...
    10 KB (904 words) - 09:19, 2 November 2024
  • the statement that the class of all finite sets is a Ramsey class. Nešetřil, Jaroslav (2016-06-14). "All the Ramsey Classes - צילום הרצאות סטודיו האנה בי...
    2 KB (339 words) - 11:32, 27 March 2023
  • set problem, and several other related graph optimization problems. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "5.5 Classes with Bounded Expansion"...
    9 KB (982 words) - 04:02, 6 December 2023
  • combinatorialists and graph theorists, including Anton Kotzig and Jaroslav Nešetřil, who wrote a thesis under Sabidussi. Over the years, he had 13 graduate...
    3 KB (253 words) - 17:01, 15 August 2024
  • did his post-doc at the Charles University in Prague in 1998 with Jaroslav Nešetřil. In 1999 he joined the University of Tübingen, where he became the...
    4 KB (253 words) - 18:09, 14 November 2024
  • if it has polynomial expansion. Nešetřil & Ossona de Mendez (2012), Section 4.2 "Shallow Minors", pp. 62–65. Nešetřil & Ossona de Mendez (2012), section...
    7 KB (857 words) - 04:08, 25 September 2024
  • 2007 from Charles University in Prague, under the supervision of Jaroslav Nešetřil. He remained as a research fellow at Charles University until 2010...
    4 KB (452 words) - 23:28, 19 November 2024
  • Thumbnail for Patrice Ossona de Mendez
    earned a habilitation in 2009 from the University of Bordeaux 1. With Jaroslav Nešetřil he is the author of the book Sparsity: Graphs, Structures, and Algorithms...
    3 KB (277 words) - 10:35, 29 July 2023
  • Thumbnail for K-tree
    Combinatorics, Information and System Sciences, 11 (2–4): 57–64, MR 0966069. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2008), "Structural Properties of Sparse...
    5 KB (486 words) - 03:58, 25 September 2024
  • Thumbnail for Graph property
    American Mathematical Society, pp. 41–42, ISBN 978-1-4704-1583-9. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "3.10 Graph Parameters", Sparsity:...
    10 KB (1,174 words) - 17:06, 2 September 2024
  • Morphisms and Statistical Physics, March 19-21, 2001, DIMACS Center, Jaroslav Nešetřil, Peter Winkler, AMS Bookstore, 2001, ISBN 0-8218-3551-3 Proc. of Combinatorics...
    8 KB (804 words) - 04:24, 18 December 2023
  • Bodlaender et al. (1995); Nešetřil & Ossona de Mendez (2012), p. 123. Nešetřil & Ossona de Mendez (2012), Lemma 6.2, p. 117. Nešetřil & Ossona de Mendez (2012)...
    21 KB (2,817 words) - 08:49, 16 July 2024
  • also known as the circuit rank or cyclomatic number. Loebl, Martin; Nešetřil, Jaroslav; Thomas, Robin (11 October 2017). A Journey Through Discrete Mathematics:...
    2 KB (230 words) - 22:22, 26 August 2024
  • (1999). "On 2-Coverings and 2-Packings of Laminar Families". In Nešetřil, Jaroslav (ed.). Algorithms - ESA' 99. Lecture Notes in Computer Science. Vol...
    2 KB (285 words) - 23:54, 27 November 2023