6th Polish Combinatorial Conference
Będlewo, September 19-23, 2016
The scientific program consists of invited 50 minute lectures, contributed 20 minute talks, and tutorials for PhD students.

The conference will begin with the Sunday dinner and end with the Saturday breakfast. The lectures are planned for Monday – Thursday, while the day of tutorials is Friday.

The book of abstracts: [pdf]

Program: (also in [pdf])
  • Sunday, September 18: arrival day
    • 18:30 - 21:30 dinner
  • Monday, September 19
    • 8:00 - 9:00 breakfast
    • 9:15 opening words
    • 9:20 - 10:15 Oliver Riordan, The phase transition in Achlioptas processes
    • 10:15 - 10:45 coffee
    • 10:45 - 13:00 special anniversary session
      • 10:45 - 11:15 Surprise Speaker 1 (Alan Frieze), Small weight sub-graphs of a randomly weighted complete graph
      • 11:20 - 11:50 Surprise Speaker 2 (Joel Spencer), Counting Connected Graphs Thrice,
      • 11:55 - 12:25 Surprise Speaker 3 (Svante Janson), Successive minimum spanning trees
      • 12:30 - 13:00 The Anticipated Speaker (Tomasz Łuczak), A sentimental journey
    • 13:15 lunch
    • 14:45 - 16:00 contributed talks (three parallel sessions 3+3+3)
    • session 1A
      • 14:45 - 15:10 David Gunderson, Extremal graphs for forbidding an odd cycle.
      • 15:10 - 15:35 Anna Fiedorowicz, Connected domination game on graphs
      • 15:35 - 16:00 Michał Przykucki, On the purity of minor-closed classes of graphs
    • session 1B
      • 14:45 - 15:10 Roberto Parente, Packing arborescences in random digraphs
      • 15:10 - 15:35 Mahdi Amani, Comparison of subtree amortization cost of pioneering data structures
      • 15:35 - 16:00 Guilherme Mota, Thresholds for anti-Ramsey properties of cycles and cliques
    • session 1C
      • 14:45 - 15:10 Aram Gharibyan, Locally-balanced 2-partitions of complete multipartite graphs
      • 15:10 - 15:35 Rafał Kalinowski, Dense arbitrarily partitionable graphs
      • 15:35 - 16:00 Matjaž Krnc, Kronecker double covers and the family of Generalized Petersen graphs
    • 16:00 - 16:30 coffee
    • 16:30 Open Mind award ceremony
    • 16:40 - 18:25 nominees' talks alphabetically (30 minutes each)
      • 16:40 - 17:15 Andrzej Grzesik, Applications of flag algebras in extremal graph theory
      • 17:15 - 17:50 Michał Lasoń, White's conjecture and other intriguing problems on matroids
      • 17:50 - 18:25 Michał Pilipczuk, On tree-like graphs
    • 19:00 banquet
  • Tuesday, September 20
    • 8:00 - 9:00 breakfast
    • 9:20 - 10:15 András Gyárfás, Chi-bounded graph classes - results and problems
    • 10:15 - 10:45 coffee
    • 10:30 - 11:30 Tom Trotter, An update on the dimension of random partially ordered sets
    • 11:45 - 13:00 contributed talks (three parallel sessions 3+3+3)
    • session 2A
      • 11:45 - 12:10 Piotr Micek, Planar posets have dimension linear in height
      • 12:10 - 12:35 Heather Smith, Saturation for induced subposets
      • 12:35 - 13:00 Funmilola Balogun, Mset chains and mset antichains of partially ordered multisets
    • session 2B
      • 11:45 - 12:10 Joanna Sokół, Localization games on graphs
      • 12:10 - 12:35 Bartłomiej Bosek, A new variant of the game of cops and robber
      • 12:35 - 13:00 Marcin Witkowski, Cops and Robber games on G^{\Xi}
    • session 2C
      • 11:45 - 12:10 Maciej Dziemiańczuk, On directed lattice paths with vertical steps
      • 12:10 - 12:35 Dragan Stevanović, Comparing closed walk counts in trees consisting of three paths
      • 12:35 - 13:00 Maycon Sambinelli, On Gallai's conjecture for series--parallel graphs and graph with maximum degree 4
    • 13:15 lunch
    • 14:45 - 16:00 contributed talks (three parallel sessions 3+3+3)
    • session 3A
      • 14:45 - 15:10 Dariusz Dereniowski, Searching partially ordered sets - a generalization of binary search
      • 15:10 - 15:35 Dorota Urbańska, Distributed searching of arbitrary graphs by mobile agents
      • 15:35 - 16:00 Krzysztof Krzywdziński, Distributed algorithms on random graphs: minimal independent set and colouring problems.
    • session 3B
      • 14:45 - 15:10 Małgorzata Sulkowska, On the improvement of result in best choice problem for powers of paths
      • 15:10 - 15:35 Wojciech Kordecki, On the q-analog of the secretary problem
      • 15:35 - 16:00 Csaba Biró, Random walk on the Cayley graph of the Baumslag–Solitar (1,2)-group
    • session 3C
      • 14:45 - 15:10 Robert Malona, On non-isomorphic tournaments with the possibility of a draw
      • 15:10 - 15:35 Erik Thornblad, Degree distributions and score functions of tournament limits
      • 15:35 - 16:00 Fiona Skerman, Guessing numbers of odd cycles
    • 16:00 - 16:30 coffee
    • 16:30 - 18:10 contributed talks (three parallel sessions 3+3)
    • session 4A
      • 16:30 - 16:55 Joanna Polcyn, A hierarchy of maximal intersecting triple systems
      • 16:55 - 17:20 Makar Plakhotnyk, On the autmorphisms of the max-plus algebra of exponent matrices
      • 17:20 - 17:45 Nikolaos Pantelidis, Riordan arrays - The Riordan group
    • session 4B
      • 16:30 - 16:55 Bartosz Walczak, Common tangents of two disjoint polygons in linear time and constant workspace
      • 16:55 - 17:20 Magdalena Łysakowska, Properties of systems of cubes
      • 17:20 - 17:45 Michał Zwierzyński, Discrete affine lambda-equidistants of polygons with parallel opposite sides
    • 18:30 dinner
    • 20:00 N is a number (the movie)
  • Wednesday, September 21
    • 8:00 - 9:00 breakfast
    • 9:20 - 10:15 Christian Reiher, A generalisation of Mantel's theorem to uniformly dense hypergraphs
    • 10:15 - 10:45 coffee
    • 10:45 - 11:40 Lutz Warnke, The phase transition in the random d-process
    • 11:45 - 13:00 contributed talks (three parallel sessions 3+3+3)
    • session 5A
      • 11:45 - 12:10 Sebastian Czerwiński, The vertex-distinguishing proper edge-coloring number of a regular graph
      • 12:10 - 12:35 Monika Pilśniak, Distinguishing graphs by proper colourings
      • 12:35 - 13:00 Aleksandra Gorzkowska, Distinguishing index and edge-cost of the Cartesian product of graphs
    • session 5B
      • 11:45 - 12:10 Mariusz Grech, Road coloring and Cerny conjecture
      • 12:10 - 12:35 Paweł Rzążewski, Complexity of token swapping and its variants
      • 12:35 - 13:00 Leila Parsaei Majd, Zero-sum flows on Steiner systems
    • session 5C
      • 11:45 - 12:10 Rafał Witkowski, Rotate-resistant de Bruijn sequence
      • 12:10 - 12:35 Maciej Ulas, Arithmetic properties of a sequence related to the Rudin-Shapiro sequence
      • 12:35 - 13:00 Piotr Miska, A simple note on p-adic valuation of Stirling numbers of the second kind
    • 13:00 lunch
    • 14:15 excursion
    • 19:00 grill party
  • Thursday, September 22
    • 8:00 - 9:00 breakfast
    • 9:20 - 10:15 Éric Sopena, Combinatorial games on graphs
    • 10:15 - 10:45 coffee
    • 10:45 - 11:40 Günter M. Ziegler, On f-vectors of 4-polytopes and 3-spheres
    • 11:45 - 13:00 contributed talks (three parallel sessions 3+3+3)
    • session 6A
      • 11:45 - 12:10 Katarzyna Rybarczyk, Algorithms for finding Hamilton cycles in random intersection graphs.
      • 12:10 - 12:35 John Sylvester, Hitting times and effective resistances in Erdős-Rényi random graphs
      • 12:35 - 13:00 Natasha Morrison, Bootstrap percolation in the hypercube
    • session 6B
      • 11:45 - 12:10 Rinovia Simanjuntak, Finding D-distance magic and antimagic graphs
      • 12:10 - 12:35 Adam Doliwa, Generalized quasi-symmetric functions: Hopf algebra structure and geometric interpretation
      • 12:35 - 13:00 ,
    • session 6C
      • 11:45 - 12:10 Olaf Parczyk, Explicit construction of universal hypergraphs
      • 12:10 - 12:35 Roman Glebov, The number of Hamiltonian decompositions of regular graphs.
      • 12:35 - 13:00 Alexandre Talon, Decomposing 8-regular graphs into paths of length 4
    • 13:15 lunch
    • 14:45 - 16:00 contributed talks (three parallel sessions 3+3+3)
    • session 7A
      • 14:45 - 15:10 Izolda Gorgol, On extremal colorings without rainbow cycles
      • 15:10 - 15:35 Anna Lechowska, Rainbow number for Hanoi graphs
      • 15:35 - 16:00 Paweł Petecki, The distinguishing chromatic polynomial
    • session 7B
      • 14:45 - 15:10 Krzysztof Węsek, Nested knapsack and bin packing problems
      • 15:10 - 15:35 Andrzej Żak, On packing large trees
      • 15:35 - 16:00 Jerzy Konarski, Near packing of two graphs
    • session 7C
      • 14:45 - 15:10 Konstanty Junosza-Szaniawski, On-line coloring and L(2,1)-labeling of unit disks intersection graphs
      • 15:10 - 15:35 Jonathan Rollin, Chromatic number of ordered graphs with forbidden ordered subgraphs
      • 15:35 - 16:00 Mohammed Senhaji, Bounded acyclic and oriented colourings
    • 16:00 - 16:30 coffee
    • 16:30 - 17:45 contributed talks (two parallel sessions 4+3)
    • session 8A
      • 16:30 - 16:55 Marcin Anholcer, Every digraph is majority 4-choosable
      • 16:55 - 17:20 Fabricio Benevides, Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
      • 17:20 - 17:45 Gabriel Jakóbczak, Sign and sight additive chromatic number
      • 17:45 - 18:10 Mathew Fitch Rational exponents for hypergraph Turan problems
    • session 8B
      • 16:30 - 16:55 Amir Kafshdar Goharshady, New dominating sets results in graphs with constant treewidth
      • 16:55 - 17:20 Przemysław Gordinowicz, How much can be saved from planar graph on fire?
      • 17:20 - 17:45 Elizabeth Taylor, The graph of critical pairs of a crown
    • 18:30 dinner
  • Friday, September 23: day of tutorials
    • 8:00 - 9:00 breakfast
    • 9:00 - 10:40 Oleg Pikhurko, Measurable combinatorics (lecture)
    • 10:40 - 11:10 coffee
    • 11:10 - 12:50 Jarosław Byrka, Optimization in algorithm design (lecture)
    • 13:00 lunch
    • 14:15 - 16:00 Oleg Pikhurko, (exercises)
    • 16:00 - 16:30 coffee
    • 16:30 - 18:15 Jarosław Byrka, (exercises)
    • 18:30 dinner
    • 19:30 - 20:30 Oleg Pikhurko, (solutions)
  • Saturday, September 24: departure day
    • 8:00 - 9:00 breakfast