Seminars 2012 – 2018

13/11/18 Zdeněk Dvořák Colouring of graphs, Part III
6/11/18 Roman Nedela Spanning trees, flows, harmonic functions and symmetries of graphs
30/10/18 Zdeněk Dvořák Colouring of graphs, Part II
23/10/18 Martina Mockovčiaková Hamilton cycles in leapfrog fullerene graphs
16/10/18 Zdeněk Dvořák Colouring of graphs, Part I
9/10/18 Borut Lužar 3-choosability of planar graphs with maximum degree 4
2/10/18 Takamasa Yashima Properly colored 2-factor theorem and its future prospects
25/9/18 Chris Purcell Boundary classes of graphs
15/5/18 Jan Ekstein Revisiting the Hamiltonian Theme in the Square of a Block --- a history and new progress
24/4/18 Přemek Holub S-pakovací barvení grafů
27/3/18 Petr Vrána The Hamilton-connectedness of 3-connected claw-free N1,1,5-free graphs
20/3/18 Dan Kráľ (University of Warwick) The step Sidorenko property and non-norming edge-transitive graphs
13/3/18 Peter Zeman Discrete and fast Fourier transform made clear using linear algebra
6/3/18 Zdeněk Ryjáček Weak coloring of line graphs
27/2/18 Tomáš Kaiser Schrijver graphs and edge-criticality
12/12/17 Marthe Bonamy (LaBRI, Bordeaux) Partitioning the vertices of a torus into isomorphic subgraphs
5/12/17 Mária Nedelová Classification of edge-transitive maps
28/11/17 Roman Nedela Hamiltonicity in 'symmetrical' graphs and maps
21/11/17 Jakub Teska Intersecting many longest paths in a connected graph
14/11/17 Adam Kabela Deciding Hamiltonicity by Max-Flow Min-Cut for cactus-like graphs
7/11/17 Petr Vrána Closure for {K1,4, K1,4 + e}-free graphs
31/10/17 Dalibor Froncek (University of Minnesota Duluth, USA) Decompositions of complete bipartite graphs into prisms revisited
24/10/17 Martina Mockovčiaková Star edge-coloring of subcubic graphs
17/10/17 Elham Aboomahigir (Tarbiat Modares University, Iran) The domination number of the intersection graph of subgroups of a group
26/9/17 Edita Rollová Perfect matchings in highly cyclically connected regular graphs
12/9/17 Peter Zeman On H-topological intersection graphs
16/5/17 Dan Kráľ (University of Warwick) Uniqueness of optimal configurations in extremal combinatorics
9/5/17 Adam Kabela Tough planar graphs with short longest cycles
2/5/17 Endre Csóka (Alfréd Rényi Institute of Mathematics, Hungary) Kőnig's line coloring and Vizing's theorems for graphings
25/4/17 Tomáš Kaiser On the Penrose polynomial of graphs
18/4/17 Liming Xiong (Beijing Institute of Technology, China) Degree sums of adjacent vertices and hamiltonian properties
28/3/17 Martina Mockovčiaková How many symbols for /k/-Thue sequences?
21/3/17 Přemek Holub Anti-Ramsey theory for bipartite graphs
14/3/17 Jan Volec (McGill University, Canada) Bounded colorings of graphs and hypergraphs
7/3/17 Shipeng Wang (Beijing Institute of Technology, China) Forbidden subgraphs for connectivity and supereulerian properties of graphs
28/2/17 Roman Nedela Harmonic morphisms of graphs
13/12/16 István Estélyi (University of Primorska, Slovenia) On the spectra and symmetries of some Cayley graph-related objects
6/12/16 Marthe Bonamy (LaBRI, Bordeaux) Reed's conjecture and strong edge coloring
29/11/16 Edita Rollová 3-flow with large support
22/11/16 Zdeněk Ryjáček Hamiltonian properties of 3-connected (claw, hourglass)-free graphs
8/11/16 Petr Vrána Thomassen's conjecture in a subclass of K1,4-free graphs
1/11/16 Borut Luzar (FIS Novo Mesto, Slovinsko) The Δ+2-conjecture in incidence coloring of graphs
25/10/16 Tomáš Kaiser The chromatic number of Schrijver graphs and topology
18/10/16 Dipendu Maity (IIS Bangalore) On centrally symmetric maps
11/10/16 Ilia Ponomarenko (Steklov Institute of Mathematics) A short introduction to Babai's quasipolynomial graph isomorphism testing
27/9/16 Edita Rollová Perfect matchings in regular bipartite graphs
20/9/16 Dan Kráľ (University of Warwick) Large graphs and uniqueness of their limits
10/5/16 Moshe Rosenfeld (University of Washington Tacoma, USA) Selected problems in graph theory
3/5/16 Martina Mockovčiaková Four ways to introduce strong edge-coloring
26/4/16 Maria Saumell Stabbing lines, circles, and the relation to cluster Voronoi diagrams
19/4/16 Martin Škoviera (Comenius University in Bratislava) Permutation snarks
5/4/16 Petr Vrána On a closure concept for a subclass of the class of K1,4-free graphs
15/3/16 Roman Nedela Cubic graphs that are critical with respect to cyclic connectivity
8/3/16 Edita Rollová New proof of Seymour's 6-flow theorem
16/2/16 Adam Kabela Toughness and Hamiltonicity of special graph classes
8/12/15 Robert Lukoťka (Comenius University in Bratislava) Short cycle covers of weighted cubic graphs
1/12/15 Adam Kabela Hamiltonian cycles in tough chordal graphs
24/11/15 Zdeněk Ryjáček Characterization of graphs with exclusive sum labeling
10/11/15 Ilkyoo Choi (KAIST, Daejeon, Korea) Progress towards conjectures on chi-bounded families
3/11/15 Maxim Limonov (Novosibirsk State University) Harmonic morphisms of graphs as 1-dimension analogue of holomorphic maps of Riemann surfaces
27/10/15 Ping Hu (University of Warwick) Extremal graph theory
13/10/15 Tomáš Kaiser Circuits, matchings and flows in cubic graphs
29/9/15 Nicolas Gastineau (Universite Bourgogne Franche-Comte) S-packing coloring of paths and grids and dichotomies properties on computational complexity of S-packing coloring problem
22/9/15 Jonathan Noel (University of Oxford) Extremal Bounds for Bootstrap Percolation in the Hypercube
16/6/15 Shinya Fujita (Yokohama City University) Some results on covering vertices by monochromatic subgraphs in edge-colored graphs
26/5/15 Joe Ryan (University of Newcastle) An overview of graph irregularity strengths
20/5/15 Bernard Lidický (Iowa State University) Precoloring distant vertices in triangle-free planar graphs
12/5/15 Jan Hladký (Institute of Mathematics, Academy of Sciences of the Czech Republic) f-vectors of flag complexes
28/4/15 Pavol Hell (Simon Fraser University, Burnaby) Forbidden structure characterizations of interval and circular arc graphs
14/4/15 Liming Xiong (Beijing Institute of Technology) An extension of the Chvatal-Erdos theorem: Counting the number of maximum independent sets
7/4/15 Kenta Ozeki (National Institute of Informatics, Tokyo) A set (g,f)-factor in graphs and its application
3/3/15 Tomáš Kaiser My favourite open problems
9/12/14 Dan Kráľ (University of Warwick) Finitely describable combinatorial limits
2/12/14 Maria Saumell Peeling potatoes near-optimally in near-linear time and Mirka Miller Radial Moore graphs
25/11/14 Martina Mockovčiaková Generalization of linear and cyclic nonrepetitive sequences
11/11/14 Novi Herawati Bong (Newcastle) EX graphs and Sudeep Stephen (Chennai) Power domination
4/11/14 Lluis Vena (Charles University) Deducing an arithmetic removal lemma from the removal lemma for hypergraphs and its applications
21/10/14 Diana Piguet A density Corradi-Hajnal theorem
14/10/14 Kristiana Wijaya (University of Newcastle) On Ramsey minimal graphs
7/10/14 Cyriac Grigorious (University of Newcastle) On conditional resolving sets of graphs
30/9/14 Joe Ryan (University of Newcastle) Totally antimagic total graphs
23/9/14 Ingo Schiermeyer (TU Freiberg) Deciding 4-colourability for (P6, Z1)-free graphs
27/5/14 Laszlo M. Lovasz (Massachusetts Institute of Technology) The height of the tower in Szemerédis regularity lemma
20/5/14 Eckhard Steffen (University of Paderborn) Circular flows
13/5/14 Liming Xiong (Beijing Institute of Technology) Factors of graphs
29/4/14 Edita Rollová What is the maximum order of a planar signed clique?
22/4/14 Binlong Li Forbidden subgraphs for hamiltonicity of 1-tough graphs
1/4/14 Diana Piguet (University of Birmingham) An approximate version of the tree packing conjecture for bounded degree trees
25/3/14 Matěj Stehlík (Université Joseph Fourier, Grenoble) Odd cycle transversals of fullerenes
11/3/14 Ilkyoo Choi (University of Illinois Urbana-Champaign) Variations of coloring of toroidal graphs
4/3/14 Robert Lukotka (University of Trnava) 2-factors in cubic graphs
25/2/14 Nico Van Cleemput Graph generation methods
18/2/14 Tomáš Kaiser Hamilton cycles and toughness in interval and chordal graphs
11/2/14 Martina Mockovčiaková Distance constrained edge colorings of graphs
10/12/13 Binlong Li The Ramsey number of paths versus wheels
3/12/13 Roman Čada Forbidden subgraphs for hamiltonicity of 3-connected K1,4-free graphs
26/11/13 Zdeněk Ryjáček Forbidden triples for rainbow connection
19/11/13 Nico Van Cleemput On Hamilton cycles in triangulations
5/11/13 Zur Izhakian (Bar Ilan University, Ramat-Gan, Israel) A glimpse on supertropical algebra and Halina Bielak (UMCS, Lublin, Poland) Ramsey numbers for graphs
22/10/13 Edita Rollová Covering signed graphs with signed circuits
8/10/13 Maria Saumell Extending partial representations of proper and unit interval graphs
24/9/13 Tomáš Kaiser Barevnost kvadrangulaci projektivnich prostoru
3/7/13 Binlong Li Heterochromatic triangles in colored graphs and Bo Ning Directed C4s in oriented bipartite graphs
14/5/13 Zdeněk Ryjáček Duhova souvislost a zakazane podgrafy
7/5/13 Edita Rollová O clanku L. M. Lovasz, C. Thomassen, Y. Wu a C.-Q. Zhang: Nowhere-zero 3-flows and modulo k-orientations
30/4/13 Jan Brousek Traceabilita v 2-souvislych grafech
9/4/13 Moshe Rosenfeld (University of Washington Tacoma) Erdos is 100 years old. Some work we did with my students in Vietnam
2/4/13 Kenta Ozeki (National Institute of Informatics, Tokyo) Tutte cycles in graphs on surfaces
19/3/13 Edita Rollová Nenulove toky v sikmych kartezskych soucinech grafu
26/2/13 Tomáš Kaiser O grupove souvislosti grafu - hlavni otevrene problemy v teto oblasti a jejich kontext
19/2/13 Zdeněk Ryjáček Indukovane podgrafy zarucujici stabilitu hamiltonovske souvislosti
12/2/13 Edita Rollová Homomorfismy signovanych grafu
4/12/12 Michal Hanzlík Grafove problemy s logaritmickou prostorovou slozitosti
27/11/12 Jan Ekstein Hledani hamiltonovskych kruznic v druhe mocnine grafu z eulerovskych tahu v multigrafech
20/11/12 Tobias Müller (Universiteit Utrecht) First order logic and random graphs
13/11/12 Jan Brousek Zakazane podgrafy a cyklicke vlastnosti grafu
6/11/12 Mirka Miller Whats New in the Degree/Diameter Problem
30/10/12 Jaroslav Šídlo Vector coloring
23/10/12 Anita Abildgaard Sillasen (Aalborg Universitet) Some problems related to the Degree/Diameter Problem
16/10/12 Arthur Hoffmann Ostenhof (TU Wien) On Problems related to the Circuit Double Cover Conjecture
2/10/12 Přemek Holub Referat o barevnosti claw-free grafu bez velkych uplnych podgrafu
25/9/12 Tomáš Kaiser Algebraicke souvislosti vety o ctyrech barvach
15/5/12 Mirka Miller Open Problems in the Degree/Diameter Problem, Part II
9/5/12 Thomas Kalinowski (Universitaet Rostock) Maximal antichains in the Boolean lattice
2/5/12 Dominique Buset (Universite Libre de Bruxelles) Some topics related to the degree/diameter problem
24/4/12 Moshe Rosenfeld (University of Washington Tacoma, USA) The Odd-Distance Graph
17/4/12 Přemek Holub Maximalni podgrafy s omezenim na stupen a diametr
10/4/12 Roman Glebov (Freie Universitaet Berlin) Conflict-free coloring of graphs
3/4/12 Roman Čada Nejdelsi kruznice ve 2-faktorech
13/3/12 Zdeněk Ryjáček Distancne lokalne nesouvisle grafy
6/3/12 Giuseppe Mazzuoccolo (Universita di Modena) Covering a graph with matchings of fixed size
28/2/12 Tomáš Kaiser Podrozdeleni Petersenova grafu v permutacnich grafech
14/2/12 Riste Škrekovski (University of Ljubljana) Some recent results on fullerene graphs