====== Matěj Stehlík ======
Professeur d'[[http://www.informatique.univ-paris-diderot.fr/|informatique]] à l'[[https://u-paris.fr/|Université Paris Cité]]\\
Membre de l'équipe [[https://www.irif.fr/equipes/graphes/index|Théorie et algorithmique des graphes]] à l'[[https://www.irif.fr/|IRIF]]

===== Publications =====
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]]) [[https://arxiv.org/abs/2308.07103|Fan's lemma via bistellar moves]], envoyé.
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]] et [[http://www.fmf.uni-lj.si/~skreko/|R. Škrekovski]]) [[https://arxiv.org/abs/2301.03420|Criticality in Sperner's lemma]], envoyé.
  * (avec [[http://www.math.rug.nl/~tobias/|T. Müller]]) [[https://arxiv.org/abs/2103.05120|On the contractibility of random Vietoris-Rips complexes]], Discrete Comput. Geom. 69 (2023) 1139-1156.
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]]) [[https://arxiv.org/abs/2007.09204|Edge-critical subgraphs of Schrijver graphs II: The general case]], J. Combin. Theory Ser. B 152 (2022) 453-482.
  * [[https://arxiv.org/abs/1910.02454|Critical digraphs with few vertices]].
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]]) [[https://arxiv.org/abs/1910.07866|Edge-critical subgraphs of Schrijver graphs]], J. Combin. Theory Ser. B 144 (2020) 191–196.
  * (avec [[http://oc.inpg.fr/esperet/|L. Esperet]]) [[https://arxiv.org/abs/1910.08388|Bipartite complements of circle graphs]], Discrete Math. 343 (2020) 111834.
  * (avec [[http://www.math.rug.nl/~tobias/|T. Müller]]) [[https://arxiv.org/abs/1710.01072|Generalised Mycielski graphs and the Borsuk-Ulam theorem]], Electron. J. Combin. 26 (2019) #P4.8.
  * (avec [[http://oc.inpg.fr/esperet/|L. Esperet]]) [[http://arxiv.org/abs/1509.07716|The width of quadrangulations of the projective plane]], J. Graph Theory 89 (2018) 76-88.
  * (avec D. Nicodemos) [[http://arxiv.org/abs/1701.07748|Packing and covering odd cycles in cubic plane graphs with small faces]], European J. Combin. 67 (2018) 208-221.
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]]) [[http://arxiv.org/abs/1604.01582|Schrijver graphs and projective quadrangulations]], in: Loebl M., Nešetřil J., Thomas R. (eds) A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek, pp. 505-526, 2017.
  * (avec D. Nicodemos) [[http://arxiv.org/abs/1604.01934|Fullerene graphs of small diameter]], MATCH Commun. Math. Comput. Chem. 77 (2017) 725-728.
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]]) [[http://arxiv.org/abs/1310.5875|Colouring quadrangulations of projective spaces]], J. Combin. Theory Ser. B. 113 (2015) 1-17.
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]], O. Rucký et [[http://www.fmf.uni-lj.si/~skreko/|R. Škrekovski]]) [[https://pagesperso.g-scop.grenoble-inp.fr/~stehlikm/papers/KRSS14.pdf|Strong parity vertex coloring of plane graphs]], Discrete Math. Theor. Comput. Sci. 16 (2014) 143-158.
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]] et [[http://www.fmf.uni-lj.si/~skreko/|R. Škrekovski]]) [[http://arxiv.org/abs/1301.6983|Replication in critical graphs and the persistence of monomial ideals]], J. Combin. Theory Ser. A 123 (2014) 239-251.
  * (avec [[http://www.cos.ufrj.br/~luerbio/|L. Faria]] et [[http://www.cos.ufrj.br/~sula/|S. Klein]]) [[http://arxiv.org/abs/1203.3912|Odd cycle transversals and independent sets in fullerene graphs]], SIAM J. Discrete Math. 26 (2012) 1458-1469.
  * (avec [[http://www.kma.zcu.cz/Tomas.Kaiser|T. Kaiser]] et [[http://www.fmf.uni-lj.si/~skreko/|R. Škrekovski]]) [[https://pagesperso.g-scop.grenoble-inp.fr/~stehlikm/papers/KSS11.pdf|On the 2-resonance of fullerenes]], SIAM J. Discrete Math. 25 (2011) 1737-1745.
  * (avec [[http://www.dur.ac.uk/r.j.kang/|R. J. Kang]] et [[http://kam.mff.cuni.cz/~sereni/|J.-S. Sereni]]) [[http://arxiv.org/abs/0912.4770|Every plane graph of maximum degree 8 has an edge-face 9-colouring]], SIAM J. Discrete Math. 25 (2011) 514-533.
  * (avec [[http://kam.mff.cuni.cz/~sereni/|J.-S. Sereni]]) [[https://pagesperso.g-scop.grenoble-inp.fr/~stehlikm/papers/SS11.pdf|Edge-face colouring of plane graphs with maximum degree nine]], J. Graph Theory 66 (2011) 332-346.
  * (avec [[http://kam.mff.cuni.cz/~sereni/|J.-S. Sereni]]) [[https://pagesperso.g-scop.grenoble-inp.fr/~stehlikm/papers/SS10.pdf|On the sextet polynomial of fullerenes]], J. Math. Chem. 47 (2010) 1121-1128.
  * (avec [[https://www.ucw.cz/~kral/index.html.en|D. Kráľ]]) [[https://pagesperso.g-scop.grenoble-inp.fr/~stehlikm/papers/KS08.pdf|Coloring of triangle-free graphs on the double torus]], SIAM J. Discrete Math. 22 (2008) 541-553.
  * [[https://pagesperso.g-scop.grenoble-inp.fr/~stehlikm/papers/Ste06.pdf|Minimal connected τ-critical hypergraphs]], Graphs Combin. 22 (2006) 421-426.
  * [[https://pagesperso.g-scop.grenoble-inp.fr/~stehlikm/papers/Ste04.pdf|A generalisation of matching and colouring]], Discrete Math. 285 (2004) 257-265.
  * [[https://pagesperso.g-scop.grenoble-inp.fr/~stehlikm/papers/Ste03.pdf|Critical graphs with connected complements]], J. Combin. Theory Ser. B 89 (2003) 189-194.

===== Contact =====
IRIF, case 7014\\
Université de Paris\\
75205 Paris Cedex 13, France\\

bureau 4008\\
tél: +33 (0) 1 57 27 93 36\\
e-mail: <matej@irif.fr>
/*{{page>inc&noheader&nofooter}}*/