Conferences  >  Mathematics  >  Graph Theory and Combinatorics

AMS, American Mathematical Society

Transfer systems are a new combinatorial object that exhibit surprising connections between abstract homotopy theory, equivariant topology, and combinatorics. About ten years ago, Blumberg and Hill defined the related "indexing systems'' as the central algebraic object controlling twisted multiplications that naturally arise in the study of equivariant cohomology theories. Rubin and Balchin--Barnes--Roitzheim independently recast this notion in a much simpler framework, characterizing indexing systems in terms of transfer systems, as a particular kind of weak subposet of the lattice of subgroups of a finite group G , ordered by inclusion. Work of Ormsby--Osorno and teams of collaborators has shown how the natural generalization of this notion to an arbitrary poset has fascinating combinatorial properties, and Balchin--MacBrough--Ormsby have further connected this to abstract homotopy theories on posets. Each of these connections provides exciting results which can be transferred and reinterpreted in the other fields, yielding unexpected new structure and theorems. This MRC will introduce participants to this burgeoning new area, bringing together researchers with interests in combinatorics, algebraic topology, and abstract homotopy theory. The field is rife with open problems, including basic questions about the structure of transfer systems, combinatorics problems associated to counting transfer systems for natural families of posets, identifying connections with other combinatorial structures, and applying the language of model categories to recast and reform these questions.

Since its inception in 1989 as AWOCA (Australasian Workshop on Combinatorial Algorithms), IWOCA has provided an annual forum for researchers who design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business. Previous IWOCA and AWOCA meetings have been held in Australia, Canada, Czech Republic, Finland, France, Germany, India, Indonesia, Italy, Japan, Singapore, South Korea, UK, Taiwan and USA.

Optimization Theory, Operational Research,    Algorithms and Data Structures

University of Alcalá, Department of Physics and Mathematics

Created in 2016 as an international conference inheriting the tradition of the Spanish meeting on Discrete Mathematics, the Discrete Mathematics Days achieve the participation of excellent researchers from all over the world.

Coding Theory and Cryptography, Combinatorial Number Theory, Combinatorics, Discrete and Computational Geometry, Discrete Optimization, Graph Theory, Theoretical Computer Science.

Numerical Analysis and Computational Mathematics,    Number Theory, Arithmetic

IPCO (Integer Programming and Combinatorial Optimization) is a conference that is sponsored by the Mathematical Programming Society. IPCO is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications of integer programming and combinatorial optimization.

Optimization Theory, Operational Research,    Algorithms and Data Structures

Universidad de Sevilla, Department of Applied Mathematics I

CODESCO'24 is the second edition of the conference Combinatorial Designs and Codes (Rijeka, Croatia, 2021). The goal of the conference is to bring together researchers interested in any of the areas including in combinatorial design theory, coding theory, graph theory, algebraic combinatorics and finite geometry, with particular emphasis on establishing new synergies among them, and new applications to other fields and to the real world, including artificial intelligence, communication networks, cryptography and machine learning.

Combinatorial designs, codes, graphs, finite groups, finite fields, finite geometries, Latin squares, quasigroups, Hadamard matrices.

Alfréd Rényi Institute of Mathematics

In 2024, Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach will turn 70. On the occasion of this joyful event, we organize a conference Sum(m)it280. We would like to invite you to celebrate these four Hungarian combinatorialists with us.

ICMS The Bayes Centre

This workshop aims to provide an opportunity for PhD students and postdocs to form new collaborations and generate new research in the areas of Extremal and Probabilistic, Geometric, and Structural Combinatorics.

American Institute of Mathematics (AIM)

This workshop, sponsored by AIM and the NSF, will be devoted to current problems relating structural properties of graphs and their connections to modern applications. Specifically, we will focus on graph labelings, invariants, and the characterization of graphs with specific or extremal parameters. We will also study structural properties of families of graphs using methods such as lifts of graphs, both random and algebraic. One goal of the workshop is to unite researchers from various backgrounds in graph theory so that theoretical advancements with a potential to make an impact in applications will result. As an AWM Women in Graph Theory and Applications (WiGA)- affiliated workshop, another goal is to develop and strengthen the support of women in the graph theory community. We welcome all who support this mission.

The main topics for the workshop are: Graph coloring, domination, and labeling and their connections to applications. Characterizing families of graphs with extremal parameters. Generating families of graphs with desired labelings, invariants, or other structural features.

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

Courses and Events for Math Students and Early Career Researchers,    Geometry and Topology

Enumerative combinatorics is a dynamic subfield of the mathematical sciences with many challenging research problems, ingenious and sophisticated techniques, and important applications in various scientific fields. Questions from a broad range of areas, including algebra, topology, probability, computer science, physical, chemical and biological sciences, have some surprising hidden combinatorial structures that require enumerative methods for their solution.

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

Courses and Events for Math Students and Early Career Researchers,    Geometry and Topology

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.

Banach Center

CIRM – Centre International de Rencontres Mathématiques

Diagrams is the only conference series that provides a united forum for all areas that are concerned with the study of diagrams and has a multidisciplinary emphasis. DIAGRAMS’24 is the fourteenth conference in the series that started in 2000. The multidisciplinary nature of Diagrams means it encompasses: architecture, art, artificial intelligence, biology, cartography, cognitive science, computer science, education, graphic design, history of science, human-computer interaction, linguistics, logic, mathematics, philosophy, psychology, and software modelling. The conference attracts a large number of researchers from these interrelated fields, positioning Diagrams as the major international event in the area.

CIRM – Centre International de Rencontres Mathématiques

Algebra,    Group Theory

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

This Dagstuhl Seminar will concentrate on developing new tools arising from the parameterized complexity of cuts, paths, and graph decompositions. The last 2 years have been very exciting for the area, with several breakthroughs.

Joint Research Center for Advanced and Fundamental Mathematics for Industry

Department of Mathematics and Statistics, University of Minnesota Duluth

Four invited lectures and 20-minute contributed talks on topics in combinatorics and graph theory.

Email: mcccc2024@d.umn.edu

LAWCG is meant to foster interaction among the Latin American Graph Theory and Combinatorics community, whose research interests include cliques, clique graphs, the behavior of cliques and other topics in Graph Theory. The official languages are English, Portuguese, and Spanish.

Isaac Newton Institute for Mathematical Sciences

This workshop will focus on various aspects of the geometry of interacting random paths. The aim is to bring together researchers specialising in random processes such as branching random walks, activated random walks, random interlacements, and other models of interacting random walks, as well as their continuous time counterparts. The workshop will explore questions and results concerning the geometry of the ranges of these processes, and further properties of their occupation time fields, for instance, their associated “thick points”. It will include two-mini courses in addition to the programme of research talks.

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

Combinatorial Mathematics Society of Australasia

The 46th Australasian Combinatorics Conference (46ACC) will be held at The University of Queensland, December 2-6, 2024. It will be an in-person, face-to-face, conference. The conference program includes invited talks, contributed talks in parallel sessions, conference dinner and presentation of the CMSA Anne Penfold Street Student Prize for the best student talk at the conference, excursion, and CMSA Annual General Meeting. Researchers in any area of combinatorics and its applications are encouraged to attend and contribute a talk.

46ACC organising committee;     Phone: [+61 7 3443 2441];     Email: 46acc@uq.edu.au

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Many discrete optimization problems can be modelled as graph problems, leading to a long list of well-studied problems, which include graph partitioning, covering and packing problems, network design problems, width parameter problems, and so on. Most of these graph problems are computationally hard. However, this situation may change if we require the input to belong to some special graph class. This leads to two fundamental questions, which lie at the heart of our Dagstuhl Seminar: for which classes of graphs can a computationally hard graph problem be solved in polynomial time, and for which classes of graphs does the problem remain hard? In our seminar, we aim to discover new insights that lead to results for a whole range of problems rather than just for a single problem alone.

Graph Algorithms, Graph Classes, Graph Containment, Relations, Parameterized Complexity, Width Parameters

Simons Laufer Mathematical Sciences Institute (SLMath)

This workshop will feature leading experts in several major areas of graph theory, including extremal, probabilistic and structural aspects of the field. Introductory lectures will form an important part of the program, providing background and motivation, and aimed at a general mathematical audience. Complementing these, research talks will share exciting recent developments in graph theory.

extremal graph theory, random graphs, probabilistic methods, structural graph theory, Ramsey theory

Institute for Pure & Applied Mathematics (IPAM)

Over the last half a century, Algebra, Combinatorics, and Discrete Geometry have undergone transformations due, in part, to the connections each of these areas have to other fields and the growth of computational approaches used in the study of theoretical mathematics. These areas are closely intertwined, with various algebraic, combinatorial, and geometric objects playing pivotal roles. These objects include monomial ideals, affine semigroup rings, Stanley-Reisner rings, Ehrhart rings, toric rings, Cox Rings, Chow Rings, Gröbner bases on the algebraic side; graphs, matroids, simplicial complexes, polytopes and polyhedral complexes, convex bodies, posets, lattices, arrangements of hyperplanes on the combinatorial and discrete geometry side.

Algebra,    Numerical Analysis and Computational Mathematics

Erwin Schrödinger International Institute for Mathematics and Physics (ESI)

Algebra,    Probability and Statistics, Game Theory

Simons Laufer Mathematical Sciences Institute (SLMath)

Many exciting breakthroughs in combinatorics involve innovative applications of techniques from a wide range of areas such as harmonic analysis, polynomial and linear algebraic methods, spectral graph theory, and representation theory. This workshop will present recent developments in this area and facilitate discussions of research problems.

extremal combinatorics, extremal graph theory, probabilistic combinatorics, discrete geometry, additive combinatorics, combinatorial geometry, incidence geometry, arithmetic progressions, Discrete analysis

Algebra,    Analysis

Simons Laufer Mathematical Sciences Institute (SLMath)

In a growing number of applications, one needs to analyze and interpret data coming from massive networks. The statistical problems arising from such applications lead to important mathematical challenges: building novel probabilistic models, understanding the possibilities and limitations for statistical detection and inference, designing efficient algorithms, and understanding the inherent limitations of fast algorithms. The workshop will bring together leading researchers in combinatorial statistics, machine learning, and random graphs in the hope of cross-fertilization of ideas.

combinatorial statistics, random graphs, network inference, network reconstruction, detection, estimation

Complex Networks,    Scientific Computing and Data Science

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Probability and Statistics, Game Theory,    Information Theory, Foundations of Computer Science

Our meeting will bring together researchers in various fields of mathematics such as Geometry, Combinatorics and Algebra. Through scientific talks new directions will be given and open problems will be proposed aiming at new collaborations among the participants.

Geometry, Combinatorics, Commutative Algebra.

Geometry and Topology,    Algebra