Mirka Miller's Combinatorics Webinar Series
From Combinatorics Wiki
Welcome to the home page for Mirka Miller's Combinatorics Webinar Series.
Meeting link: https://meet.google.com/kgc-uwpc-ngp
Contents
Upcoming Talks
Date: Wednesday June 16 2021
Time: 18:00 (CET)
Speaker: Prof. Felix Lazebnik
Title: The story about graphs CD(k,q)
Abstract: In this talk I will present the main ideas and history behind the construction of the family of graphs that is usually denoted by CD(k,q), where k is a positive integer, and q is a prime power. It is known that the girth of CD(k,q) (the length of its shortest cycle) is at least k+5, and these graphs provide the best known asymptotic lower bound for the greatest number of edges in graphs of a given order and given girth at least g, where g ≥ 5 and g distinct from 11, 12. We survey some old and new results, and mention several open questions related to these graphs or to similarly constructed graphs.
Previous Talks
Talk 1: Celebrating Mirka's life - Prof. Camino Balbuena
Date: March 8th 2021
Time 17:00 (CET)
Celebrating Mirka's life
Chair: Prof. Gabriela Araujo-Pardo
"Remembering Prof. Mirka Miller"
by Prof. Cristina Dalfó
Speaker: Prof. Camino Balbuena
Title: On the Moore cages with a prescribed girth pair
Abstract: https://drive.google.com/file/d/11r-TY8NswuKZkT7LOfkl-4yy1d72aF-w/view?usp=sharing
Slides: https://drive.google.com/file/d/1GkbwwNYSLBgRGjE8z7n1ckuXbXb6sRrN/view?usp=sharing
Video: https://drive.google.com/file/d/1DuWvsAsxMoIzCH4wr_hpGqUCx5uv89SU/view?usp=sharing {Chair: Prof. Gabriela Araujo-Pardo (minute 0:00-04:08) - "Remembering Prof. Mirka Miller" by Prof. Cristina Dalfó (minute 04:08-17:44) - Speaker: Prof. Camino Balbuena On the Moore cages with a prescribed girth pair (minute 17:44-end)}
Talk 2: May there be many more repeats - Prof. Jozef Širáň
Date: Wednesday April 14 2021
Time: 1000 Bratislava (0900 UK)
Speaker: Prof. Jozef Širáň
Title: May there be many more repeats
Abstract: This is my reminiscence on two mathematical aspects of my collaboration with Mirka Miller in the degree-diameter problem: the lifting technique in constructions of `large' examples and her method of repeats in non-existence proofs.
Video: https://drive.google.com/file/d/1Ss2xvDP9UAIebNUnIr2U6J01wixUJFkK/view?usp=sharing {Chair: Prof. Camino Balbuena (minute 0:00-02:26) - Speaker: Prof. Jozef Širáň May there be many more repeats (minute 02:26-end)}
Talk 3: The Domination Blocking Game - Prof. Dominique Buset
Date: Wednesday May 12 2021
Time: 11:00 (CET) - one hour later than the previous one
Speaker: Prof. Dominique Buset
Title: The Domination Blocking Game
Abstract: We introduce a new game on a simple, finite and undirected graph: “the domination tracking game”. Two players (the Dominator and the Enemy), each one playing alternatively, take a not occupied vertex on the graph. When the dominator (resp. the enemy) takes a vertex, he controls the vertex and all its neigbours (resp. just the vertex taken). The purpose of the game is for the dominator to control all the vertices, and for the enemy to avoid the dominator to win (i.e. to take one vertex and all his neighbours). We determine for some categories of graphs a winning strategy either for the Dominator or the Enemy. These situations, give a partition of those graphs into three classes. https://drive.google.com/file/d/1V8WY_qlqCDHdZLFsTokOQ-7t7KBtnqSG/view?usp=sharing
As part of the initiatives of Women in Mathematics Day
Video: https://drive.google.com/file/d/1HIv1fixjrWZfcRYHwN3QgntBKMoMK1Mt/view?usp=sharing
{Chair: Prof. Cristina Dalfó - Speaker: Prof. Dominique Buset The Domination Blocking Game }
Obituaries: Mirka Miller (nee Koutova) https://drive.google.com/file/d/1su6y1qhUkR3PosqRDfFSGhFbKz1oseP1/view?usp=sharing
Special Issue in Honour of Mirka Miller https://drive.google.com/file/d/1wWRIXelvnGhkOM7IlhZhH0G0xxT6rd0s/view?usp=sharing
In memoriam Emeritus Professor Mirka Miller https://drive.google.com/file/d/1WQVHk41Yi5fJuGhWYscN9CwwirdU8uOu/view?usp=sharing
Eulogy for Professor Mirka Miller (1949–2016) [v https://drive.google.com/file/d/1hTS8HxU9omjlF2Q-_jOQIREcguR1Y1FU/view?usp=sharing]
A family of mixed graphs with large order and diameter 2 https://drive.google.com/file/d/1zbwb56QKY1iSeOm6c4ko178Y0UXNIzfL/view?usp=sharing
Photos
Organisers
• Marién Abreu - Dipartimento di Matematica, Informatica ed Economia - Università degli Studi della Basilicata - Potenza, Italia
• Gabriela Araujo-Pardo - Mathematics Institute-Juriquilla - Universidad Nacional Autónoma de México, México
• Camino Balbuena - Department of Civil and Enviromental Engineering - Universitat Politècnica de Catalunya, Spain
• Cristina Dalfó - Cryptography and Graphs Research Group - Universitat de Lleida, Igualada (Barcelona), Catalonia
• Tatiana Jajcayova - Faculty of Mathematics, Physics and Informatics - Comenius University, Bratislava, Slovakia
Honorary Organiser
• Joe Ryan - School of Electrical Engineering and Computing - University of Newcastle, Australia
Website Host and Support
• Grahame Erskine - Department of Mathematics of Statistics - The Open University, UK.
(the organisers thank him for kindly including this website in Combinatorics Wiki)