Meetings/Workshops on Graph Theory and Combinatorics in the United States (USA)

Select a location
MCCCC — 34th Midwest Conference on Combinatorics and Combinatorial Computing
27 Oct 2021 - 29 Oct 2021 • University of Nevada, Las Vegas, NV, United States
Event listing ID:
Related subject(s):
34th Midwest Conference on Combinatorics and Combinatorial Computing
29 Oct 2021 • The University of Nevada Las Vegas Las Vegas, Nevada, United States
As the name indicates, this is a combinatorics conference. There will be six plenary speakers: Brian Alspach, Darryn Bryant, Fan Chung, Marijn Heule, Mateja Sajna and Richard Wilson. Also, the participants are invited to give a 20-minute contributed talk.
Event listing ID:
20th Triangle Lectures in Combinatorics
14 Nov 2021 • Greensboro, NC – online, United States
University of North Carolina, Greensboro, NC
These are a series of combinatorial workshops, held once per semester, each on a Saturday. The series began with its first meeting in spring 2010. They rotate among the universities in and around the Research Triangle. Participants come from numerous colleges and universities within a few hours drive, and some from even farther away. These workshops are funded by the National Science Foundation, in particular enabling us to bring in four exciting speakers to give one hour talks each time as well as funding travel expenses for participants.
Event listing ID:
AIM Workshop: Spectral graph and hypergraph theory: connections and applications
06 Dec 2021 - 10 Dec 2021 • American Institute of Mathematics - Online workshop, United States
This workshop, sponsored by AIM and the NSF, will be devoted to spectral graph theory and its extensions to digraphs and hypergraphs.
Event listing ID:
Braids in Representation Theory and Algebraic Combinatorics
14 Feb 2022 - 18 Feb 2022 • Providence, RI, United States
Braid groups and their generalizations play a central role in a number of places in 21st-century mathematics. In modern representation theory, braid groups have come to play an important organizing role, somewhat analogous to the role played by Weyl groups in classical representation theory. Recent advances have established strong connections between homological algebra (t-structures and stability conditions), geometric representation theory (Hilbert schemes, the Hecke category, and link homologies), and algebraic combinatorics (shuffle algebras, symmetric functions, and also Garside theory). Braid groups appear prominently in many of these connections. The goal of this workshop will be to bring experts in these different areas together to both communicate recent advances and also to formulate important questions for future work.
Phone: [401 863 5030];     Email:
Event listing ID:
PP2022 — Permutation Patterns 2022
20 Jun 2022 - 24 Jun 2022 • Valparaiso, Indiana, United States
Valparaiso University, Department of Mathematics and Statistics
The 20th International Conference on Permutation Patterns will be held at Valparaiso University (Valparaiso, Indiana, USA). The conference will feature current research in the area of permutation patterns and its applications. Major themes in the conference include the structural theory of pattern classes, asymptotic behavior of pattern classes, generalized pattern avoidance, packing densities, and algorithmic and decidability problems.
permutation, pattern class, packing density, enumerative combinatorics, algebraic combinatorics
Abstract submission deadline:
30 Apr 2022
Event listing ID:
Summer Graduate School — Random Graphs
05 Jul 2022 - 16 Jul 2022 • Mathematical Sciences Research Institute, Berkeley, United States
Mathematical Sciences Research Institute (MRSI)
The topic of random graphs is at the forefront of applied probability, and it is one of the central topics in multidisciplinary science where mathematical ideas are used to model and understand the real world. At the same time, random graphs pose challenging mathematical problems that have attracted the attention from probabilists and combinatorialists since the 1960, with the pioneering work of Erdös and Rényi. Around the turn of the millennium, very large data sets started to become available, and several applied disciplines started to realize that many real-world networks, even though they are from various different origins, share many fascinating features. In particular, many of such networks are small worlds, meaning that graph distances in them are typically quite small, and they are scalefree, in the sense that there are enormous differences in the number of connections that their elements make. In particular, such networks are quite different from the classical random graph models, such as proposed by Erdös and Rényi. Spurred by these findings, many novel models have been introduced and properties have been investigated.
Event listing ID:
1443911 offers, as part of its business activities, a directory of upcoming scientific and technical meetings. The calendar is published for the convenience of conference participants and we strive to support conference organisers who need to publish their upcoming events. Although great care is being taken to ensure the correctness of all entries, we cannot accept any liability that may arise from the presence, absence or incorrectness of any particular information on this website. Always check with the meeting organiser before making arrangements to participate in an event!

Last updated: 10 September 2021