Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Erdős Numbers

Paul Erdős (1913—1996), the widely-traveled and incredibly prolific Hungarian mathematician of the highest caliber, wrote hundreds of mathematical research papers in many different areas, many in collaboration with others.

Erdős's Erdős number is 0. Erdős's coauthors have Erdős number 1. People other than Erdős who have written a joint paper with someone with Erdős number 1 but not with Erdős have Erdős number 2 (like myself), and so on. If there is no chain of coauthorships connecting someone with Erdős, then that person's Erdős number is said to be infinite.

Stefan Szeider's Erdős Number is 2. He is connected with Erdős via two separate chains of coauthorships of length two.

The first chain is via Carsten Thomassen and the papers:

  1. M. Fellows, M. Fomin, D. Lokshtanov, F. Rosamond, S. Saurabh, S. Szeider, and C. Thomassen. On the complexity of some colorful problems parameterized by treewidth. Information and Computation, vol. 209, no. 2, pp. 143-153, 2011.
  2. C. Thomassen, P. Erdős, Y. Alavi, P.J. Malde, and A. Schwenk. Tight bounds on the chromatic sum of a connected graph. J. Graph Theory 13 (1989), no. 3, 353-357.

The second chain is via Noga Alon and the papers:

  1. N. Alon and P Erdős. An application of graph theory to additive number theory. European J. Combin. 6 (1985), no. 3, 201-203.
  2. N. Alon, G. Gutin, E.J. Kim, S. Szeider and A. Yeo. Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica, vol. 61, no. 3, 2011, pp. 638-655.

News

  • PhD completed by Andre Schidler

    PhD completed by Andre Schidler

    2023-05-31
    Congratulations to André Schidler, who successfully defended his PhD thesis "Scalability for SAT-based combinatorial problem solving" today.   Thanks to …Read More »
  • PhD completed by Vaidyanathan P.R.

    PhD completed by Vaidyanathan P.R.

    2023-05-12
    Congratulations to Vaidyanathan P.R., who successfully defended his PhD thesis Scalable Bayesian Network Structure Learning using SAT-based Methods today. Thanks …Read More »
  • New FWF ESPRIT Postdocs

    New FWF ESPRIT Postdocs

    2022-11-09
    Leroy Chew and Alexis de Colnet just joined the Algorithms and Complexity group as PIs of their own FWF ESPRIT …Read More »
  • Best student paper award at DIAGRAMS 2022

    Best student paper award at DIAGRAMS 2022

    2022-10-01
    Alexander Dobler received the Best Student Paper Award at the 13th International Conference on the Theory and Application of Diagrams …Read More »
  • Robert Ganian promoted to Associate Professor

    Robert Ganian promoted to Associate Professor

    2022-07-01
    Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020, 2021 and 2022.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.