Перейти к содержимому
Купавский
Персональный сайт Андрея Купавского
  • Главная
  • Публикации
  • Преподавание
  • Конференции
  • Разное
  • Поездки
  • English
  • Building Bridges II, Budapest, July 2018
  • 2nd Russian-Hungarian Combinatorial Workshop, Budapest, June 2018,  Talk on ``The Erdős Matching Conjecture and related questions''
  • 8th Emlektabla Workshop, Velence, June 2018
  • Symposium on Computational Geometry'18, Budapest, June 2018, Talk on ``Triangles: Erdős, Tutte and Butterflies'' (slides are a courtesy of János Pach)
  • 18th Gremo Workshop on Open Problems, Kiental, June 2018
  • One-day Metting in Combinatorics, Oxford, May 2018
  • Oxford Combinatorics Seminar, May 2018, Talk on ``The Erdős Matching Conjecture''
  • London Combinatorics Colloquium, May 2018
  • Bristol Combinatorics Seminar, May 2018, Talk on ``The Erdős Matching Conjecture''
  • Geometric Transversals and Epsilon-Nets, Ein-Gedi, April 2018.
  • Seminar on Combinatorics, Games and Optimization at LSE, March 2018. Talk on  ``Lower Bounds for Line Searching Robots - Some Faulty''
  • Extremal Problems in Combinatorial Geometry, Banff, February 2018. Talk on ``Lower Bounds for Line Searching Robots - Some Faulty''
  • Birmingham Combinatorics Seminar, December 2017. Talk on ``Intersecting Families''
  • EuroComb'17, Vienna, August 2017. Talk on ``Families with Forbidden Subconfigurations''
  • The Second Malta Conference in Graph Theory and Combinatorics, Malta, June 2017. Intersecting families
  • 15th Gremo Workshop on Open Problems, Kiental, June 2017
  • Recent Advances in Extremal Combinatorics Workshop, Sanya, May 2017 Families with forbidden subconfigurations
  • First Russian-Hungarian Workshop on Discrete Mathematics, April 2017  Families with forbidden subconfigurations
  • Workshop on Discrete Geometry, Oberwolfach, April 2017
  • MIPT-59, Moscow, November 2016
  • Oktoberfest in Combinatorial Geometry, Lausanne, October 2016. Hypergraphs with no s pairwise disjoint edges
  • Journées Graphes et Algorithmes, Paris, November 2016
  • JCDCG^3, Tokyo, September 2016
  • The Mathematics of Jiří Matoušek, Prague, July 2016
  • New Era in Discrete and Computational Geometry, Ascona, June 2016. New lower bounds for \epsilon-nets
  • Combinatorics: challenges and applications, Tel Aviv, January 2016
  • Moscow Workshop on Discrete Geometry, Moscow, September 2015. Covering the space by slabs
  • Ascension of Combinatorics, Lausanne, May 2015. Covering the space by slabs
  • Workshop on High-dimensional Expanders, Les Diablerets, March 2015.
  • Midrasha School on Combinatorics, Jerusalem, January 2015.
  • Sum(m)it 240, Budapest, July 2014. On cliques in diameter graphs and On random subgraphs of a Kneser graph
  • Moscow Workshop on Combinatorics and Number Theory, Moscow, January 2014. Diameter graphs in \mathbb R^4 and Proof of Schur's conjecture
  • EuroComb, Pisa, September 2013. Two notions of unit distance graphs
  • Random structures and algorithms, Poznan', August 2013. Unit distance graphs with no large cliques or short cycles and high chromatic number
  • ICWSM'13, Boston, July 2013.
  • Erdős Centennial, Budapest, July 2013.
  • AIST'13, Ekaterinburg, April 2013. Каскады ретвитов - анализ и прогнозирование
  • CIKM'12, Maui, October 2012. Prediction of retweet cascades over time
  • 4th Polish Combinatorial Conference, Poznan', September 2012. On some geometric Ramsey theory problem
  • Cycles and colorings, Novy Smokovec, September 2012. Distance graph with big girth and large chromatic number
  • SIAM conference on discrete mathematics, Halifax, June 2012. Colorings of uniform hypergraphs with large girth
  • 8th International Petrozavodsk conference ``Probabilistic methods in discrete mathematics'', Petrozavodsk, June 2012. Дистанционные графы с большим обхватом и большим хроматическим числом
  • Diophantine approximation: state of the art and applications, Minsk, July 2011. The chromatic number of the normed spaces
  • Infinite and finite sets, Budapest, June 2011. The chromatic numbers of normed spaces and On densest sets avoiding unit distance
  • 7th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 2011. The chromatic number of distance graphs and applications to combinatorial problems
  • Geometric Graph Theory, Lausanne, Switzerland, September-October 2010.
  • International conference dedicated to the 120 anniversary of B.N. Delone, Moscow, Russia, August 2010. The chromatic number of a normed space
  • 8FCC, Orsay, France, June-July 2010. Counterexamples to Borsuk's conjecture on spheres of small radii
  • Eurocomb, Bordeaux, France, September 2009. Chromatic number of small-dimensional Euclidean spaces
  • Fete of Combinatorics and Computer Science, Keszthely, Lake Balaton, Hungary, August 2008. Dividing three-dimensional sets into 5 parts of smaller diameter
© 2023 Купавский
Прокрутка вверх