7th Polish Combinatorial Conference
Będlewo, September 24-28, 2018
The scientific program consists of invited 50 minute lectures, contributed 20 minute talks, and tutorials for PhD students.

Unparalleled lectures are held in room A.

The book of abstracts: [pdf]

Monday Tuesday Wednesday Thursday Friday
breakfast
Wojciech Samotij
tutorial
Entropy and counting
Marcin Pilipczuk
tutorial
The square root phenomenon: subexponential algorithms in sparse graph classes
Andrzej Kisielewicz Alexandr V. Kostochka Jakub Kozik
coffee
Skerman Coulson Seweryn Sokół Przykucki Muller Mishra Okrasa Masařík
Espuny Díaz Walczak Kielak Junosza-Szaniawski Kozieł Kaemawichanurat Sanhueza Matamala Anholcer Mikos
coffee Johansson Malona Czerwiński Zamora Luna Gutowski Mészáros Węsek Tyniec-Motyka Dereniowski
Wojciech Samotij Marcin Pilipczuk Bloznelis Antoniuk Volec Lang Grech Gropp
Zając Stojaković Trotter
lunch
Béla Bollobás Dhruv Mubayi Oriol Serra
Grytczuk
coffee coffee
Open Mind award ceremony and Open Mind lectures Bagheri Torres Kamčev excursion Kushwaha Pankov Polcyn Paweł Prałat
Saadat Akhtar Kwiatkowski Bielak Benoumhani Oboudi Condon
Micek Morawiec Gorgol Gordinowicz Żak Shahriari
Miotk Furmańczyk Miska
dinner


Program:
  • Sunday, September 23: arrival day
    • 18:30 - 21:30 dinner
  • Monday, September 24
    • 8:00 - 9:00 breakfast
    • 9:10 - 9:15 opening words
    • 9:15 - 13:00 Tutorial I: Wojciech Samotij, Entropy and counting
      • 9:15 - 10:15 part 1
      • 10:30 - 11:30 part 2
      • 11:30 - 12:00 coffee
      • 12:00 - 13:00 part 3
    • 13:30 lunch
    • 15:00 - 16:00 Béla Bollobás, Sieves, random Xorsat and the sharp threshold for making squares
    • 16:00 - 16:30 coffee
    • 16:30 Open Mind award ceremony
    • 16:40 - 18:25 nominees' talks alphabetically (30 minutes each)
      • 16:40 - 17:10 Andrzej Grzesik, Forcing cycles in directed graphs
      • 17:15 - 17:45 Jakub Konieczny, Digital sequences from the perspective of additive combinatorics
      • 17:50 - 18:20 Paweł Rzążewski, Fine-grained complexity in geometric intersection graphs
    • 19:00 banquet
  • Tuesday, September 25
    • 8:00 - 9:00 breakfast
    • 9:15 - 13:00 Tutorial II: Marcin Pilipczuk, The square root phenomenon: subexponential algorithms in sparse graph classes
      • 9:15 - 10:15 part 1
      • 10:30 - 11:30 part 2
      • 11:30 - 12:00 coffee
      • 12:00 - 13:00 part 3
    • 13:30 lunch
    • 15:00 - 16:00 Dhruv Mubayi, New developments in hypergraph Ramsey theory
    • 16:00 - 16:30 coffee
    • 16:30 - 18:30 contributed talks (three parallel sessions 4+4+4)
    • session 1A
      • 16:30 - 17:00 Yousef Bagheri, Some lower bounds of the energy of graphs
      • 17:00 - 17:30 Sima Saadat Akhtar, Some bounds on the energy of signed complete bipartite graphs
      • 17:30 - 18:00 Piotr Micek, Unavoidable minors of 2-connected graphs with large pathwidth
      • 18:00 - 18:30 Mateusz Miotk, Certified domination
    • session 1B
      • 16:30 - 17:00 Jacinta Torres, Branching rules and bijections
      • 17:00 - 17:30 Mariusz Kwiatkowski, The graphs of projective codes
      • 17:30 - 18:00 Adam Morawiec, On the structure of Steinhaus boards
      • 18:00 - 18:30 Hanna Furmańczyk, Equitable colorings of hypergraphs
    • session 1C
      • 16:30 - 17:00 Nina Kamčev, Intervals in the Hales-Jewett theorem
      • 17:00 - 17:30 Halina Bielak, Multicolor Ramsey numbers for some selected graphs
      • 17:30 - 18:00 Izolda Gorgol, Induced Ramsey numbers for multiple copies of graphs
      • 18:00 - 18:30 Piotr Miska, $p$-adic denseness of members of partitions of $\\mathbb{N}$ and $p$-adic asymptotic densities
    • 18:30 dinner
  • Wednesday, September 26
    • 8:00 - 9:00 breakfast
    • 9:00 - 10:00 Andrzej Kisielewicz, König’s problem on permutation groups
    • 10:00 - 10:30 coffee
    • 10:30 - 12:30 contributed talks (three parallel sessions 4+4+3)
    • session 2A
      • 10:30 - 11:00 Fiona Skerman, Galton-Watson trees and tree automata
      • 11:00 - 11:30 Alberto Espuny Díaz, Edge correlations in random regular hypergraphs
      • 11:30 - 12:00 Tony Johansson, The cover time of a biased random walk on the random regular graph
      • 12:00 - 12:30 Mindaugas Bloznelis, Normal approximation to the number of small cliques in sparse random intersection graphs
    • session 2B
      • 10:30 - 11:00 Matthew Coulson, Rainbow Hamilton cycles in Dirac graphs
      • 11:00 - 11:30 Bartosz Walczak, Sparse Kneser graphs are Hamiltonian
      • 11:30 - 12:00 Robert Malona, Hamiltonicity in tournaments with scores
      • 12:00 - 12:30 Sylwia Antoniuk, Powers of Hamiltonian cycles in randomly augmented graphs
    • session 2C
      • 10:30 - 11:00 Michał Seweryn, The dimension of posets with excluded minors in cover graphs
      • 11:00 - 11:30 Bartłomiej Kielak, On the maximum number of odd cycles in graphs without smaller odd cycles
      • 11:30 - 12:00 Sebastian Czerwiński, Generalized arboricity of graphs with large girth
    • 12:45 - 13:15 Mariusz Zając, A short proof of Brooks\' theorem
    • 13:30 lunch
    • 14:15 excursion
    • 19:00 grill party
  • Thursday, September 27
    • 8:00 - 9:00 breakfast
    • 9:00 - 10:00 Alexandr V. Kostochka, Extremal problems on paths and matchings in ordered and convex geometric hypergraphs
    • 10:00 - 10:30 coffee
    • 10:30 - 12:30 contributed talks (three parallel sessions 4+4+4)
    • session 3A
      • 10:30 - 11:00 Joanna Sokół, Online coloring of intersection graphs of various shapes
      • 11:00 - 11:30 Konstanty Junosza-Szaniawski, Online coloring of short intervals
      • 11:30 - 12:00 Oscar Zamora Luna, Avoiding long Berge cycles
      • 12:00 - 12:30 Jan Volec, Transversal and colorful versions of Mantel\'s theorem
    • session 3B
      • 10:30 - 11:00 Michał Przykucki, Shotgun assembly of the hypercube
      • 11:00 - 11:30 Patryk Kozieł, Uniform random posets
      • 11:30 - 12:00 Grzegorz Gutowski, Acyclic edge-coloring using entropy compression
      • 12:00 - 12:30 Richard Lang, Monochromatic cycle partitions in random graphs
    • session 3C
      • 10:30 - 11:00 Carole Muller, Excluded minors for embeddings of metric graphs in $\\ell_\\infty^k$-spaces
      • 11:00 - 11:30 Pawaton Kaemawichanurat, Connected domination critical graphs with cut vertices
      • 11:30 - 12:00 Tamás Mészáros, Boolean dimension and tree-width
      • 12:00 - 12:30 Mariusz Grech, Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups
    • 12:45 - 13:15 Miloš Stojaković, Semi-random graph process
    • 13:30 lunch
    • 15:00 - 16:00 Oriol Serra, Additive Extremal Sets
    • 16:00 - 16:30 coffee
    • 16:30 - 18:00 contributed talks (three parallel sessions 3+3+3)
    • session 4A
      • 16:30 - 17:00 Seema Kushwaha, $f_{\\sqrt{m},2}$-graph and related continued fractions
      • 17:00 - 17:30 Moussa Benoumhani, On the unimodality of the open set polynomial
      • 17:30 - 18:00 Przemysław Gordinowicz, Some properties of automorphism group of countable homogeneous posets
    • session 4B
      • 16:30 - 17:00 Mark Pankov, Z-knotted triangulations
      • 17:00 - 17:30 Mohammad Reza Oboudi, On the spectral radius of graphs
      • 17:30 - 18:00 Andrzej Żak, The size of a largest component vs. node fault tolerance
    • session 4C
      • 16:30 - 17:00 Joanna Polcyn, The structure of large hypergraphs with forbidden intersections
      • 17:00 - 17:30 Padraig Condon, A bandwidth theorem for approximate decompositions
      • 17:30 - 18:00 Shahriar Shahriari, Forbidden configurations for posets of subspaces
    • 18:30 dinner
  • Friday, September 28
    • 8:00 - 9:00 breakfast
    • 9:00 - 10:00 Jakub Kozik, Coloring algorithms for small hypergraphs
    • 10:00 - 10:30 coffee
    • 10:30 - 12:30 contributed talks (three parallel sessions 3+4+3)
    • session 5A
      • 10:30 - 11:00 Suchisimita Mishra, Strong chromatic index of graph products
      • 11:00 - 11:30 Nicolás Sanhueza Matamala, An asymptotic bound for the strong chromatic number
      • 11:30 - 12:00 Krzysztof Węsek, Lower bounds for coloring of the plane
    • session 5B
      • 10:30 - 11:00 Karolina Okrasa, Intersecting edge distinguishing colorings of hypergraphs
      • 11:00 - 11:30 Marcin Anholcer, Nowhere-zero group irregular labelings of graphs
      • 11:30 - 12:00 Magdalena Tyniec-Motyka, Maximal edge-colorings of graphs
      • 12:30 - 12:30 Harald Gropp, Configurations - the state of the art
    • session 5C
      • 10:30 - 11:00 Tomáš Masařík, Parameterized approximation schemes for steiner trees with small number of Steiner vertices
      • 11:00 - 11:30 Patryk Mikos, FirstFit on-line coloring of short intervals with bandwidths
      • 11:30 - 12:00 Dariusz Dereniowski, On-line tree exploration strategies
    • 12:45 - 13:15 William Trotter, Two challenging conjectures for planar posets
    • 13:30 lunch
    • 15:30 - 16:00 Jarosław Grytczuk, On some coloring problems of the integers
    • 16:00 - 16:30 coffee
    • 16:30 - 17:30 Paweł Prałat, k-regular subgraphs near the k-core threshold of a random graph
    • 18:30 dinner
  • Saturday, September 29: departure day
    • 8:00 - 9:00 breakfast