5th Polish Combinatorial Conference
Będlewo, September 22-26, 2014
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 outline:
Monday Tuesday Wednesday Thursday Friday
breakfast
opening   Daniel Kráľ
tutorial
Limits of discrete structures and their applications
János Pach Benny Sudakov Alan Frieze Daniela Kühn
coffee
Stanisław Radziszowski Piotr Sankowski Tuza Deryk Osthus Adrian Kosowski
tutorial
Deterministic walks on graphs: exploration and diffusion
Micek Martinjak Witkowski Taylor Kozik Sulkowska Pokrovskiy
Mominul Haque Miska Gyimesi Staden Ueckerdt Schmidt Przykucki Townsend
Pszczoła Dębski Nyul Florek Junosza-Szaniawski Pilśniak Amani
lunch
Kamat Rajkumar Czerwiński Lasoń excursion Szymkowiak Sokół Daniel Kráľ
(lecture continued,
exercises)
Pushnyakov Jesse-Józefczyk Rzążewski Stronkowski Theis Khachatrian
Afzaly Heise Rybarczyk Stronkowski Krzywdziński Węsek
coffee coffee
Open Mind award ceremony
Open Mind lectures		 Antoniuk Chuprunov Wijaya Mikalački Adrian Kosowski
(lecture continued,
exercises)
Pankov Kadivar Jackowska Bednarska-Bzdęga
Evdokimov Kwasiborski Raeisi Bujtás
Grech Tuczyński Dąbrowska Gordinowicz
dinner banquet dinner
    Daniel Kráľ
(solutions)
    Adrian Kosowski
(solutions)
Program:
  • Sunday, September 21: arrival day
    • 18:30 dinner
  • Monday, September 22
    • 8:00 - 9:00 breakfast
    • 9:00 opening address
    • 9:05 - 10:00 János Pach, My Happy Ending Problem
    • 10:00 - 10:30 coffee
    • 10:30 - 11:30 Stanisław Radziszowski, Ramsey arrowing of triangles
    • 11:45 - 13:00 contributed talks (two parallel sessions 3+3)
    • session 1A
      • 11:45 - 12:10 Piotr Micek, On the dimension of posets with cover graphs of treewidth 2
      • 12:10 - 12:35 Khandoker Mohammed Mominul Haque, Irregular total labelling of Möbius ladder $M_n$
      • 12:35 - 13:00 Krzysztof Pszczoła, On some properties of the $k$-transitive closure of a directed path
    • session 1B
      • 11:45 - 12:10 Ivica Martinjak, Polarized partitions and partitions with $d$-distant parts
      • 12:10 - 12:35 Piotr Miska, Arithmetic properties of sequence of derangements and its generalizations
      • 12:35 - 13:00 Michał Dębski, The mystery of sequences of large radius
    • 13:00 lunch
    • 14:45 - 16:00 contributed talks (two parallel sessions 3+3)
    • session 2A
      • 14:45 - 15:10 Vikram Kamat, Erdős-Ko-Rado theorems: stability analysis and a new generalization
      • 15:10 - 15:35 Philipp Pushnyakov, Around Turán's theorem
      • 15:35 - 16:00 Seyedeh Narjess Afzaly, Extremal graphs without given cycles
    • session 2B
      • 14:45 - 15:10 Anitha Rajkumar, The pseudograph $(r, s, a, t)$-threshold number
      • 15:10 - 15:35 Katarzyna Jesse-Józefczyk, Graph decompositions and the expansion of secure sets
      • 15:35 - 16:00 Carl Georg Heise, Nonempty intersection of longest paths in series-parallel graphs
    • 16:00 - 16:30 coffee
    • 16:30 Open Mind award ceremony
    • 16:40 - 18:25 nominees' talks alphabetically (35 minutes each)
      • 16:40 - 17:15 Marek Cygan, Using FPT tools to approximate $k$-Set Packing
      • 17:15 - 17:50 Aleksander Mądry, From graphs to matrices, and back: bridging the combinatorial and the continuous
      • 17:50 - 18:25 Bartosz Walczak, Coloring geometric intersection graphs and related problems
    • 18:30 dinner
  • Tuesday, September 23
    • 8:00 - 9:00 breakfast
    • 9:00 - 10:00 Benny Sudakov, Grid Ramsey problem and related questions
    • 10:00 - 10:30 coffee
    • 10:30 - 11:30 Piotr Sankowski, Online bipartite matching in offline time
    • 11:45 - 13:00 contributed talks (two parallel sessions 3+3)
    • session 3A
      • 11:45 - 12:10 Rafał Witkowski, De Bruijn sequence in 2D
      • 12:10 - 12:35 Eszter Gyimesi, A new combinatorial interpretation of $r$-Whitney numbers
      • 12:35 - 13:00 Gábor Nyul, Generalization of combinatorial numbers for graphs
    • session 3B
      • 11:45 - 12:10 Amelia Taylor, Arbitrary orientations of Hamilton cycles in digraphs
      • 12:10 - 12:35 Katherine Staden, Embedding squares of Hamilton cycles via degree sequence conditions
      • 12:35 - 13:00 Jan Florek, On Barnette's Conjecture
    • 13:00 lunch
    • 14:45 - 16:00 contributed talks (two parallel sessions 3+3)
    • session 4A
      • 14:45 - 15:10 Sebastian Czerwiński, Harmonious coloring of hypergraphs
      • 15:10 - 15:35 Paweł Rzążewski, (Pseudo)achromatic coloring of fragmentable hypergraphs
      • 15:35 - 16:00 Katarzyna Rybarczyk, The chromatic index of random hypergraphs
    • session 4B
      • 14:45 - 15:10 Michał Lasoń, On the toric ideal of a matroid and related problems
      • 15:10 - 15:35 Michał Stronkowski, Finite axiomatization for quasivarieties of digraphs
      • 15:35 - 16:00
    • 16:00 - 16:30 coffee
    • 16:30 - 18:10 contributed talks (two parallel sessions 4+4)
    • session 5A
      • 16:30 - 16:55 Sylwia Antoniuk, On a very sharp threshold for collapse of random triangular groups
      • 16:55 - 17:20 Mark Pankov, On distance two in the Cayley graphs of Coxeter groups
      • 17:20 - 17:45 Sergei Evdokimov, Coset closure of a circulant S-ring and schurity problem
      • 17:45 - 18:10 Mariusz Grech, Semiregular automorphism groups of the graphical structures
    • session 5B
      • 16:30 - 16:55 Alexey Chuprunov, Practical approach in telecommunications for theory of distribution for distinguished random particles
      • 16:55 - 17:20 Mehdi Kadivar, Minimum flow problem, motivation and algorithms
      • 17:20 - 17:45 Sławomir Kwasiborski, Fastest, average and quantile schedule
      • 17:45 - 18:10 Michał Tuczyński, Counting independent sets via Divide, Measure and Conquer method
    • 18:30 dinner
  • Wednesday, September 24
    • 8:00 - 9:00 breakfast
    • 9:00 - 10:00 Alan Frieze, Variations on Maker-Breaker graph games
    • 10:00 - 10:30 coffee
    • 10:30 - 11:00 Zsolt Tuza, Choice identification in graphs
    • 11:00 - 11:30 Jakub Kozik, Multipass random greedy coloring of simple uniform hypergraphs
    • 11:30 - 12:15 contributed talks (two parallel sessions 2+2)
    • session 6A
      • 11:30 - 11:55 Torsten Ueckerdt, On-line coloring between two lines
      • 11:55 - 12:15 Konstanty Junosza-Szaniawski, Fixing improper colorings of graphs
    • session 6B
      • 11:30 - 11:55 Tina Janne Schmidt, On the relationship of large minimum bisection and tree width in planar graphs
      • 11:50 - 12:15 Monika Pilśniak, Distinguishing graphs by edge colourings
    • 13:00 lunch
    • 14:00 excursion
    • 19:00 banquet
  • Thursday, September 25
    • 8:00 - 9:00 breakfast
    • 9:00 - 9:50 Daniela Kühn, On the typical structure of oriented graphs and digraphs with forbidden tournaments or cycles
    • 10:00 - 10:30 coffee
    • 10:30 - 11:30 Deryk Osthus, Decompositions of graphs into small subgraphs
    • 11:45 - 13:00 contributed talks (two parallel sessions 3+3)
    • session 7A
      • 11:45 - 12:10 Małgorzata Sulkowska, Percolation and best choice problem for powers of paths
      • 12:10 - 12:35 Michał Przykucki, The time of graph bootstrap percolation
      • 12:35 - 13:00 Mahdi Amani, Ranking and unranking algorithm for neuronal trees in $B$-order
    • session 7B
      • 11:45 - 12:10 Alexey Pokrovskiy, Linkage structures in tournaments
      • 12:10 - 12:35 Timothy Townsend, Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
      • 12:35 - 13:00
    • 13:00 lunch
    • 14:45 - 16:00 contributed talks (two parallel sessions 3+3)
    • session 8A
      • 14:45 - 15:10 Magdalena Szymkowiak, A randomized $k$ tracks variant of the Gate Matrix Layout problem
      • 15:10 - 15:35 Dirk Oliver Theis, Nondeterministic communication complexity of random 01 matrices
      • 15:35 - 16:00 Krzysztof Krzywdziński, Distributed algorithms and random graphs - MST problem
    • session 8B
      • 14:45 - 15:10 Joanna Sokół, Fractional and $j$-fold colouring of the plane
      • 15:10 - 15:35 Hrant Khachatrian, On interval edge-colorings of complete multipartite graphs
      • 15:35 - 16:00 Krzysztof Węsek, Avoiding repetitions on the plane
    • 16:00 - 16:30 coffee
    • 16:30 - 18:10 contributed talks (two parallel sessions 4+4)
    • session 9A
      • 16:30 - 16:55 Kristiana Wijaya, On Ramsey $(mK_2,H)$-minimal graphs
      • 16:55 - 17:20 Eliza Jackowska, The 3-colored Ramsey number of 3-uniform loose paths of length 3
      • 17:20 - 17:45 Ghaffar Raeisi, Ramsey number of disjoint copies of linear hypergraphs
      • 17:45 - 18:10 Kinga Dąbrowska, Multicolor Ramsey Numbers for cycles or paths versus some subgraphs of wheels
    • session 9B
      • 16:30 - 16:55 Mirjana Mikalački, How fast can Maker win in biased games on $E(K_n)$?
      • 16:55 - 17:20 Małgorzata Bednarska-Bzdęga, Waiter-Client games
      • 17:20 - 17:45 Csilla Bujtás, On the game domination number of graphs with given minimum degree
      • 17:45 - 18:10 Przemysław Gordinowicz, Cops, robbers and ordinals
    • 18:30 dinner
  • Friday, September 26: day of tutorials
    • 8:00 - 9:00 breakfast
    • 9:00 - 10:40 Daniel Kráľ, Limits of discrete structures and their applications (lecture)
    • 10:40 - 11:10 coffee
    • 11:10 - 12:50 Adrian Kosowski Deterministic walks on graphs: exploration and diffusion (lecture)
    • 13:00 lunch
    • 14:15 - 16:00 Daniel Kráľ, (lecture continued, exercises)
    • 16:00 - 16:30 coffee
    • 16:30 - 18:15 Adrian Kosowski, (lecture continued, exercises)
    • 18:30 dinner
    • 19:30 - 20:30 Daniel Kráľ, (solutions)
    • 20:30 - 21:30 Adrian Kosowski, (solutions)
  • Saturday, September 27: departure day
    • 8:00 - 9:00 breakfast