3rd Polish Combinatorial Conference
Będlewo, September 24-30, 2010
The scientific program consists of invited 50 minute lectures, contributed 20 minute talks, and tutorials for PhD students.

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

Program outline:
Saturday Sunday Monday Tuesday Wednesday
breakfast
opening   Michał Karoński
(tutorial lecture)
Pavol Hell William T. Trotter Michael Elkin Mirosław Truszczyński
coffee
Xuding Zhu open problems
session		 Piotr Indyk Adrian Bondy Michał Karoński
(exercises)
Rytter Sidorowicz Szymańska Bloznelis
Micek Roberts Fiedorowicz Samotij
lunch
Kurauskas Matecki excursion Petryshyn Kalinowski Grech Horwath Michał Karoński
(solutions)
Radavičius Gordinowicz Rożej Anholcer Jesse-Józefczyk Kouider
Rybarczyk Zwierzchowski Rzążewski Żelazny Mestre Sołtys
Nehez Rosiak Junosza-Szaniawski Walczak Ulas Krzywdziński
coffee Silva Każmierczak coffee
Krawczyk Tsikouras open mind award ceremony
open mind lectures:
Bartłomiej Bosek
Andrzej Dudek		 Kuchta Suhadi
Lasoń Tasoulas Sułkowska Grzesik
Dębski Penson Kozik Tuczyński
Ueckerdt Górska Krysztowiak  
dinner banquet dinner
Program:
  • Friday, September 24: arrival day
    • 18:30 dinner
  • Saturday, September 25
    • 8:00 - 9:00 breakfast
    • 9:10 opening remarks
    • 9:15 - 10:15 Pavol Hell, List Homomorphisms [pdf]
    • 10:15 - 10:45 coffee
    • 10:45 - 11:45 Xuding Zhu, Entire colouring of plane graphs
    • 12:00 - 12:50 contributed talks
      session 1
      • 12:00 - 12:25 Wojciech Rytter, The structure of graphs representing all subwords of Thue-Morse sequences [pdf]
      • 12:25 - 12:50 Piotr Micek, Nonrepetitive sequences [pdf]
    • 13:00 lunch
    • 14:15 - 15:55 contributed talks
      session 2A
      • 14:15 - 14:40 Valentas Kurauskas, Small subgraphs in random intersection digraphs [pdf]
      • 14:40 - 15:05 Irmantas Radavičius, On Existence of Hamilton Cycles in Uniform Random Intersection Graphs [pdf]
      • 15:05 - 15:30 Katarzyna Rybarczyk, A new method for establishing sharp threshold functions in random intersection graphs. [pdf]
      • 15:30 - 15:55 Martin Nehez, A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs [pdf]
      session 2B
      • 14:15 - 14:40 Grzegorz Matecki, Adaptive matching on bipartite graphs [pdf]
      • 14:40 - 15:05 Przemysław Gordinowicz, Let's play the cleaning game [pdf]
      • 15:05 - 15:30 Maciej Zwierzchowski, On Signed Star Domination Number [pdf]
      • 15:30 - 15:55 Jolanta Rosiak, Local exponents of primitive digraphs [pdf]
    • 16:00 - 16:30 coffee
    • 16:30 - 18:20 contributed talks
      session 3A
      • 16:30 - 16:55 Tomasz Krawczyk, First-Fit coloring of cocomparability graphs [pdf]
      • 16:55 - 17:20 Michal Lasoń, Extremal problem for crossing vectors [pdf]
      • 17:20 - 17:45 Michał Dębski, Decomposing 2-colored boolean lattice into 2-colored chains of length 2 [pdf]
      • 17:45 - 18:10 Torsten Ueckerdt, Enumeration of a Poset's Ideals [pdf]
      session 3B
      • 16:30 - 16:55 Panagiotis-Georgios Tsikouras, The enumeration of strings at height $j$ in Dyck paths [pdf]
      • 16:55 - 17:20 Ioannis Tasoulas, Statistics on ordered trees and Dyck paths [pdf]
      • 17:20 - 17:45 Karol Penson, Fuss-Catalan and Raney Distributions Versus Products of Random Matrices [pdf]
      • 17:45 - 18:10 Katarzyna Gorska, On the Combinatorial Content of One-sided Lévy Stable Probability Distribution [pdf]
    • 18:30 dinner
  • Sunday, September 26
    • 8:00 - 9:00 breakfast
    • 9:15 - 10:15 William T. Trotter, Recent Progress in the Combinatorics of Posets
    • 10:15 - 10:45 coffee
    • 10:45 - 11:45 open problems session
    • 12:00 - 12:50 contributed talks
      session 4
      • 12:00 - 12:25 Elżbieta Sidorowicz, Colouring games and the game defect of graphs [pdf]
      • 12:25 - 12:50 Ian Roberts, Extremal problems in Sperner Theory and Combinatorial Designs [pdf]
    • 13:00 lunch
    • 13:50 - 19:00 excursion
    • 19:30 dinner
  • Monday, September 27
    • 8:00 - 9:00 breakfast
    • 9:15 - 10:15 Michael Elkin, An Improved Construction of Progression-Free Sets
    • 10:15 - 10:45 coffee
    • 10:45 - 11:45 Piotr Indyk, Sparse recovery using sparse matrices
    • 11:45 - 13:00 contributed talks
      session 5
      • 12:10 - 12:35 Edyta Szymanska, The Complexity of Vertex Coloring Problems in Dense Uniform Hypergraphs
      • 12:35 - 13:00 Anna Fiedorowicz, Ramsey-type theorems related to Q-colourings of graphs [pdf]
    • 13:00 lunch
    • 14:15 - 16:20 contributed talks
      session 6A
      • 14:15 - 14:40 Nataliya Petryshyn, On rooted packings of graphs [pdf]
      • 14:40 - 15:05 Łukasz Rożej, Decomposition of sparse claw-free graphs, with application to game coloring [pdf]
      • 15:05 - 15:30 Paweł Rzążewski, On the number of 2-packings in a connected graph [pdf]
      • 15:30 - 15:55 Konstanty Junosza-Szaniawski, On improved exact algorithm for $L(2,1)$-labeling of graphs [pdf]
      • 15:55 - 16:20 Maria Emilia Silva, A generalization of chromatic polynomial of a graph subdivision [pdf]
      session 6B
      • 14:15 - 14:40 Rafał Kalinowski, Edge distinguishing index of a graph [pdf]
      • 14:40 - 15:05 Marcin Anholcer, Irregular Labelings of Circulant Graphs [pdf]
      • 15:05 - 15:30 Wiktor Żelazny, Additive colourings of graphs [pdf]
      • 15:30 - 15:55 Bartosz Walczak, On-line coloring of rectangle graphs [pdf]
      • 15:55 - 16:20 Wojciech Kaźmierczak, Best choice problem for single-branching binary trees [pdf]
    • 16:30 - 17:00 coffee
    • 17:00 open mind award ceremony
    • 17:10 - 17:50 open mind lecture: Bartłomiej Bosek, The sub-exponential upper bound for on-line chain partitioning
    • 17:50 - 18:30 open mind lecture: Andrzej Dudek, Hamilton Cycles in Random Hypergraphs [pdf]
    • 19:00 banquet
  • Tuesday, September 28
    • 8:00 - 9:00 breakfast
    • 9:15 - 10:15 Mirosław Truszczyński, Representing and reasoning about preferences - combinatorics meets decision theory [pdf]
    • 10:15 - 10:45 coffee
    • 10:45 - 11:45 Adrian Bondy, Switching Reconstruction of Directed and Coloured Graphs
    • 12:00 - 12:50 contributed talks
      session 7
      • 12:00 - 12:25 Mindaugas Bloznelis, Birth of a strongly connected giant in an inhomogeneous random digraph [pdf]
      • 12:25 - 12:50 Wojciech Samotij, Large bounded degree trees in random graphs [pdf]
    • 13:00 lunch
    • 14:15 - 15:55 contributed talks
      session 8A
      • 14:15 - 14:40 Mariusz Grech, Semiregular automorphism groups of graphical structures [pdf]
      • 14:40 - 15:05 Katarzyna Jesse-Józefczyk, Monotonicity and expansion of global secure sets [pdf]
      • 15:05 - 15:30 Angela Mestre, Riordan arrays via umbral calculus [pdf]
      • 15:30 - 15:55 Maciej Ulas, Arithmetic properties of certain generalizations of Stern diatomic sequence [pdf]
      session 8B
      • 14:15 - 14:40 Leszek Horwath, Preemptive online weighted scheduling [pdf]
      • 14:40 - 15:05 Mekkia Kouider, On f-factors [pdf]
      • 15:05 - 15:30 Karolina Sołtys, Kropki are PSPACE-complete [pdf]
      • 15:30 - 15:55 Krzysztof Krzywdziński, The complexity of distributed BFS in ad hoc networks [pdf]
    • 16:00 - 16:30 coffee
    • 16:30 - 18:10 contributed talks
      session 9A
      • 16:30 - 16:55 Małgorzata Kuchta, Multiple secretary problem [pdf]
      • 16:55 - 17:20 Małgorzata Sulkowska, Graph-theoretic generalization of the best choice problem; randomized analysis of a simple effective algorithm for k-ary trees [pdf]
      • 17:20 - 17:45 Jakub Kozik, Generalised Secretary Problem - Dynamic Threshold Strategy [pdf]
      • 17:45 - 18:10 Przemysław Krysztowiak, On fixed-parameter tractability of the jump number problem of interval orders [pdf]
      session 9B
      • 16:30 - 16:55 Suhadi Wido Saputro, The metric dimension of the composition product of graphs [pdf]
      • 16:55 - 17:20 Andrzej Grzesik, Indicated colorings of graphs [pdf]
      • 17:20 - 17:45 Michał Tuczyński, Counting transversals in claw-free graphs. [pdf]
      • 17:45 - 18:10 ,
    • 18:30 dinner
  • Wednesday, September 29: day of tutorials
    • 8:00 - 9:00 breakfast
    • 9:00 - 10:30 Michał Karoński, Random web graphs (lecture)
    • 10:30 - 11:00 coffee
    • 11:00 - 12:30 Michał Karoński (exercises)
    • 13:00 lunch
    • 14:00 - 15:30 Michał Karoński (solutions)
    • 18:30 dinner
  • Thursday, September 30: departure day
    • 8:00 - 9:00 breakfast