Research Programs

 

SEMINARS

Graphs, Hypergraphs, and Computing

May 13 15:30 - 16:30

Half-sandwich of random graphs

Matas Sileikis - Uppsala University
May 08 15:30 - 16:30

Partition Regular Equations

Imre Leader - University of Cambridge
May 08 14:00 - 15:00

Uniform Hypergraphs Containing no Grids

Miklos Ruszinko - Alfred Renyi Institute of Mathematics
May 06 15:30 - 16:30

Monochromatic covers in edge-colored graphs and hypergraphs

Gabor Sarkozy - Worcester Polytechnic Institute
May 06 14:00 - 15:00

Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs

Stanislaw P. Radziszowski - Rochester Institute of Technology, RIT
May 02 11:30 - 12:30

A few random open problems, some of them for random graphs

Pawel Pralat - Ryerson University
May 02 10:15 - 11:15

Deciding Bell number for hereditary graph properties

Vadim Lozin - University of Warwick
April 29 15:30 - 16:30

Coloring edge-weighted (di)graphs

Magnus M. Halldorsson - Reykjavik University
April 29 14:00 - 15:00

On the reconstruction of a graph with large diameter

Helge Tverberg - University of Bergen
April 24 15:30 - 16:30

Improved counting relative to pseudorandom graphs

Jozef Skokan - The London School of Economics and Political Science (LSE)
April 24 14:00 - 15:00

Locally irregular hypergraph labelings

Michal Karonski - Adam Mickiewicz University
April 22 14:00 - 15:30

Extremal graphs for connectedness

Penny Haxell - University of Waterloo
April 17 14:00 - 15:00

(Arc-)disjoint (branching) flows in networks}

Joergen Bang-Jensen - University of Southern Denmark
April 15 15:30 - 16:30

On Alternating Chromatic Number

Hossein Hajiabolhassan - Technical University of Denmark, DTU
April 15 14:00 - 15:00

Non-Cayley vertex-transitive graphs and non-Cayley numbers

Cui Zhang - Technical University of Denmark, DTU
April 10 15:30 - 16:30

Independent Sets in Hypergraphs

Dhruv Mubayi - University of Illinois at Chicago
April 10 14:00 - 15:00

On Ramsey-type problems for sequences and permutations

Andrzej Dudek - Western Michigan University
April 08 15:30 - 16:30

Minimum matching, replica symmetry, and exploration games

Joel Larsson - Umeå University
April 08 14:00 - 15:00

Morphing planar graphs

Penny Haxell - University of Waterloo
April 03 14:00 - 15:00

The minimum number of nonnegative edges in hypergraphs

Benjamin Sudakov - University of California, UCLA
April 01 15:30 - 16:30

Packing trees into n-chromatic graphs

Andras Gyarfas - Alfred Renyi Institute of Mathematics
April 01 14:00 - 15:00

Infinite dimensional finitely forcible graphon

Tereza Klimosova - University of Warwick
March 27 15:30 - 16:30

More graph width parameters and minors: linear rankwidth and vertex minors

Andrzej Proskurowski - University of Oregon
March 27 14:00 - 15:00

Combinatorics of Permutations

Jacob Fox - Massachusetts Institute of Technology, MIT
March 25 15:30 - 16:30

On 2-factors of k cycles

Ervin Gyori - Alfred Renyi Institute of Mathematics
March 25 14:00 - 15:00

A prompt collapse of the random triangular group

Sylwia Antoniuk - Adam Mickiewicz University
March 20 15:30 - 16:30

The Erd\H{o}s-Gy\'arf\'as problem on generalized Ramsey numbers

David Conlon - University of Oxford
March 20 14:00 - 15:00

The expansion method in Turan problems

Tao Jiang - Miami University
March 18 15:30 - 16:30

Separating path systems

Victor Falgas-Ravry - Umeå University
March 18 14:00 - 15:00

Notes on switching reconstruction

Brendan McKay - Australian National University
March 13 15:30 - 16:30

Constructions of short k-radius sequences

Zbigniew Lonc - Warsaw University of Technology
March 13 14:00 - 15:00

Interval edge colorings of (a,b)-biregular bipartite graphs

Carl Johan Casselgren - Linköping University
March 11 15:30 - 16:30

Approximate Isoperimetric Inequalities

Demetres Christofides - The University of Central Lancashire, UCLan Cyprus
March 11 14:00 - 15:00

A trick for proving properties of (a,b)-sparse graphs

Alexandr V. Kostochka - University of Illinois at Urbana-Champaign
March 06 15:30 - 16:30

Efficient distributed graph algorithms in wireless networks

Dariusz Kowalski - University of Liverpool
March 06 14:00 - 15:00

On Zarankiewicz' conjecture: the crossing number of K(m,n)

Bruce Richter - University of Waterloo
March 04 15:30 - 16:30

Nonrepetitive colorings of graphs

Jaroslaw Grytczuk - Jagiellonian University
March 04 14:00 - 15:00

Equitable Coloring of Graphs and Digraphs

Hal Kierstead - Arizona State University
February 27 15:30 - 16:30

Orientations of infinite graphs

Carsten Thomassen - Technical University of Denmark, DTU
February 27 14:00 - 15:00

Cluster Editing and subexponential algorithms

Fedor Fomin - University of Bergen
February 25 15:30 - 16:30

Vertex distinguishing colorings of graphs

Mariusz Wozniak - AGH University of Science and Technology
February 25 14:00 - 15:00

Quasirandomness of permutations

Daniel Kral - University of Warwick
February 20 15:30 - 16:30

Distributed Graph Coloring and Other Symmetry Breaking Problems

Michael Elkin - Ben Gurion University of the Negev
February 20 14:00 - 15:00

Proof of the 1-factorization and Hamilton decomposition conjectures

Allan Lo - University of Birmingham
February 18 15:30 - 16:30

The height of the tower in the Regularity Lemma

Laszlo Lovasz - Massachusetts Institute of Technology, MIT
February 18 14:00 - 15:00

On the chromatic number of generalized shift graphs

Tomasz Luczak - Adam Mickiewicz University
February 13 15:30 - 16:30

Embedding trees into graphs

Miklos Simonovits - Alfred Renyi Institute of Mathematics
February 13 14:00 - 15:00

Some problems and results on transformations of edge colorings of graphs

Armen Asratian - Linköping University
February 11 15:30 - 16:30

Judicious partitions of graphs

Benjamin Sudakov - University of California, UCLA
February 11 14:00 - 15:00

Approximate Counting of Matchings in (3,3)-graphs

Edyta Szymanska - Adam Mickiewicz University
February 06 15:30 - 16:30

Rigidity of point-line frameworks

Bill Jackson - Queen Mary, University of London
February 06 14:00 - 15:00

Large subgraphs without short cycles

Michael Krivelevich - Tel Aviv University
February 04 15:30 - 16:30

From distance-2-colourings of graphs to colourings of hypergraphs

Jan van den Heuvel - The London School of Economics and Political Science (LSE)
February 04 14:00 - 15:00

Extremal Theorems for Trees and Cycles in Hypergraphs

Jacques Verstraete - University of California, San Diego
January 30 15:30 - 16:30

Independent sets in hypergraphs

Andrew Thomason - University of Cambridge
January 30 14:00 - 15:00

Sparse blow-up lemmas and maker-breaker games

Julia Böttcher - The London School of Economics and Political Science (LSE)
January 28 15:30 - 16:30

Tight cycles and regular slices in dense hypergraphs

Peter Allen - The London School of Economics and Political Science (LSE)
January 23 15:30 - 16:30

Graph Searches, Cocomparability Graphs and Posets

Derek G. Corneil - University of Toronto
January 23 14:00 - 15:00

An approximate version of the Tree Packing Conjecture

Diana Piguet - University of Birmingham
January 21 15:30 - 16:30

Limiting probabilities for properties of random planar graph

Anusch Taraz - Technische Universität Hamburg-Harburg
January 21 14:00 - 15:00

Loebl-Komlos-Sos Conjecture and embedding trees in sparse graphs

Jan Hladky - University of Warwick
January 16 15:30 - 16:30

Measurable edge-colourings of graphings

Oleg Pikhurko - University of Warwick
January 16 14:00 - 15:00

On problems concerning (arc-)disjoint structures in a digraph

Joergen Bang-Jensen - University of Southern Denmark

Program
Contact

Klas Markström

klas.markstrom@math.umu.se

Other
information

For practical matters at the Institute, send an e-mail to secretary@mittag-leffler.se