Graph-theoretic trees appear in many contexts, such as the structure of chemical compounds and phylogenetic trees explaining bacterial mutations. Questions in this workshop are motivated by chemical and biological structures, but the work will lie primarily in the theoretical realm of extremal graph theory and enumerative combinatorics. These include extremal problems on graph invariants (distance-based, degree-based and counting-based), tree reconstruction (enumerating certain types of binary trees and problems related to phylogenetic subtrees), algorithm design related to the combinatorics of genome rearrangements, etc. Our MRC will provide a focused long-term agenda for junior researchers to work in these areas. Participants will be provided introductory lectures as well as guidance towards open problems for collaborative research on selected topics. Some background in discrete mathematics would be helpful, but is not required.
Read the organizers’ article in the February Notices of the AMS for more information.
Please note that you may apply to more than one MRC conference if they match your research interests. A separate application is needed for each one. However, you can only be selected as a participant in one conference.
Applications were accepted on MathPrograms with an application deadline of February 15, 2022. No new applications are being accepted at this time.
For questions about the application process, please contact the Programs Department at the AMS.