Conferences  >  Mathematics  >  Graph Theory and Combinatorics

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

Department of Pure Mathematics, University of Calcutta, India

International Conference on Pure Mathematics and its Applications (ICPMA-2025) aims to bring together several leading academicians and researchers from different corners of the world to exchange their knowledge and share their research outcomes. This conference intends to provide a platform, particularly for young researchers, to learn from the veterans and rejuvenate through the academic discussions with the experts of various fields of mathematics.

Convenor or Jt. Convenor;     Email: cupuremathseminar@caluniv.ac.in

Algebra, Differential Equations, Dynamical Systems and Nonlinear Analysis, Functional Analysis, Geometry and Topology, Graph Theory, Harmonic Analysis, Mathematical Logic, Measure Theory, Number Theory and Cryptography, Real and Complex Analysis.

Geometry and Topology,    Algebra

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

Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University

Researchers working on graph algorithms use a broad range of different criteria for deciding what makes an algorithm efficient. While in theory the dominant benchmark is the asymptotic running time, in practice the story is more nuanced: an algorithm needs to be simple enough to be implementable, fast on graphs of bounded size, space efficient, cache-friendly, and easy to test. While many of these requirements motivate interesting algorithmic questions that are highly relevant in practice, they are often overlooked by the theory community. The goal of the workshop is to foster the exchange of ideas between researchers working on graph algorithms, which have high practical relevance. The workshop will include overview talks on the various perspectives, research talks, an open problem session, and structured time for collaboration.

ICERM Program Staff;     Phone: [+1 (401) 863-5030];     Email: info@icerm.brown.edu

graph algorithms, data science, networks

Algorithms and Data Structures,    Scientific Computing and Data Science

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

Institute for Computational and Experimental Research in Mathematics (ICERM)

This workshop will be centered on recent advances in graph rigidity and interactions between rigidity, algebraic statistics, and matroid theory. Three major advances are the recent resolution of the matroid maximality conjecture, the newly developed link to maximum likelihood estimation in Gaussian graphical models, and the recent positive resolution of Lovasz and Yemini's connectivity conjecture for generic rigidity. The workshop will showcase a diverse sample of current work addressing fundamental problems in graph rigidity, algebraic matroids, and algebraic statistics.

ICERM;     Email: info@icerm.brown.edu

CIRM – Centre International de Rencontres Mathématiques

Combinatorial statements, such as theorems of Caratheodory, Radon, Helly, Sperner, Tucker, Ky Fan, etc., are fundamental results of combinatorial (algebraic) topology, accessible to non-specialists, which are immediately applicable to mathematical economics, data science, game theory, graph theory, mathematical optimization, computational geometry, and other fields. The aim of our project is to study the “Ky Fan correspondence » between the topology of triangulated spherical bundles and combinatorics of generalized labelings (coloring) of the associated simplicial complexes. Guided by the review of De Loera et. al. (Bull. Amer. Math. Soc., 2019) we explore the consequences of this correspondence for the envy-free and fair division problem, Tverberg-type theorems, and other related problems of topological combinatorics.

Institute for Computational and Experimental Research in Mathematics (ICERM)

The geometric arrangement of a material’s constituents plays an important role in governing its behavior. Concepts from discrete mathematics to describe these geometric arrangements, including notions of rigidity and flexibility, can bring fundamental insight into how a material might respond to stress, be designed, be reconfigured, etc. Beyond materials, the notions of network rigidity can be applied to more abstract networks and geometries, such as those found in data science. This workshop aims to build connections between the field of mathematical rigidity theory, other topics in applied mathematics, and related areas of science and engineering.

ICERM;     Email: info@icerm.brown.edu

Geometry and Topology,    Chemicals and Materials Science

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

CIRM – Centre International de Rencontres Mathématiques

Friezes, introduced 50 years ago by Coxeter, are patterns of integers defined by a simple, local condition. They consist of a finite (or infinite) number of rows written in a lattice, starting with a row of 0s and a row of 1s and satisfying a local SL2-rule: for any four neighbours a, b, c, d forming a diamond we require ad − bc = 1. Since the discovery of links to cluster algebras of type A, a plethora of generalisations have been studied in the last decades. With this workshop, we will provide a platform to establish new links between friezes and research areas in geometry, algebra and combinatorics.

Geometry and Topology,    Algebra

Banach Center

Trier University, Computer Science Department

WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. This conference series has a long tradition and bridges discrete mathematics and computer science. WG is mainly concerned with efficient algorithms of various types (e.g., sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks. The goal is to present recent results and to identify and explore directions for future research.

PC Chairs;     Phone: [(not so relevant)];     Email: fernau@uni-trier.de; kindermann@uni-trier.de

design and analysis of sequential, parallel, randomized, parameterized algorithms, distributed graph and network algorithms, structural graph theory with algorithmic or complexity applications, computational complexity of graph and network problems, graph grammars, graph rewriting systems and graph modeling, graph drawing and layouts, computational geometry, computational biology, graph mining, random graphs and models of the web and scale-free networks, support of the above concepts by suitable implementations and applications.

Trier University, Computer Science Department

WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. This conference series has a long tradition and bridges discrete mathematics and computer science. WG is mainly concerned with efficient algorithms of various types (e.g., sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks. The goal is to present recent results and to identify and explore directions for future research.

PC Chairs;     Phone: [(not so relevant)];     Email: fernau@uni-trier.de; kindermann@uni-trier.de

design and analysis of sequential, parallel, randomized, parameterized algorithms, distributed graph and network algorithms, structural graph theory with algorithmic or complexity applications, computational complexity of graph and network problems, graph grammars, graph rewriting systems and graph modeling, graph drawing and layouts, computational geometry, computational biology, graph mining, random graphs and models of the web and scale-free networks, support of the above concepts by suitable implementations and applications.

Alfréd Rényi Institute of Mathematics

Eurocomb, the European Conference on Combinatorics, Graph Theory and Applications, is an academic conference in the mathematical field of combinatorics. Topics include algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, graph theory, ordered sets, random methods, and topological combinatorics.

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

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

AGH University of Krakow, Poland

This will be a subsequent event in the series of conferences organized by the Faculty of Applied Mathematics of AGH University of Krakow.

Email: graphs@agh.edu.pl

Algebraic Graph Theory, Algorithmic Graph Theory, Design Theory, Domination Graph Theory, Extremal Graph Theory, Graphs Colouring, Graph Product, Labelings of Graphs, Probabilistic Methods and Random Graphs.

Victoria University of Wellington, School of Mathematics and Statistics

The Australasian Combinatorics Conference (ACC) is the annual conference of the CMSA, and covers all areas of combinatorics in mathematics and computer science. Any researchers in these areas are encouraged to attend and contribute a talk.

Organisers;     Email: 47AustCombCon@gmail.com

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