no

Speaker

Abstract

Presentation

1

Wiam Belkouche

On a problem of Frankl and Füredi


2

Jonathan Chapman

Partition regularity for systems of Diophantine equations


3

Brahim Chergui

Prime 3uniform hypergraphs


4

Sylwia CichaczPrzeniosło

Group magic labeling of disjoint copies of bipartite graphs


5

Aram Gharibyan

Complexity results on locallybalanced 2partitions of bipartite graphs


6

Aghasi Ghazaryan

Some Results on the palette index of Sierpińskilike graphs


7

Aleksandra Gorzkowska

Edgedistinguishing of starfree graphs


8

Stephen Gould

Almost all optimally coloured complete graphs
contain a rainbow Hamilton path


9

Ervin Gyori

(Generalized) planar Turán number of cycles

Presentation not available

10

Amarja Kathapurkar

Removing induced even cycles from a graph


11

Borys Kuca

Counting polynomial configurations in subsets of finite fields


12

Jakub Kwaśny

Improved bound on rdistant strong chromatic index


13

Soufiane Lakhlifi

On the spectral reconstruction problem for digraphs


14

Mikhail Makarov

Logical complexity of induced subgraph isomorphism for certain graph families


15

Zaidi Mohamed

About 3uniform hypergraphs


16

Patrick Morris

Ryser's conjecture for tintersecting hypergraphs


17

Karolina Okrasa

Complexity of Hcoloring in hereditary graph classes


18

Balazs Patkos

Stability of extremal connected hypergraphs
avoiding Bergepaths


19

Vincent Pfenninger

Towards Lehel's conjecture for 4uniform tight cycles


20

Marta Piecyk

List homomorphism problem parameterized by cutwidth


21

Joanna Polcyn

The Ramsey number of a long even cycle versus a star


22

Igor Rodionov

Extreme value theory for dependent random
variables with application to random graphs


23

Nika Salia

Inverse Turán numbers

Presentation not available

24

Matas Šileikis

Concentration of Extension Counts in G(n, p)


25

Tomasz Skalski

Maximum likelihood estimators for discrete exponential families and random graphs


26

Fiona Skerman

No additional tournaments are quasirandomforcing


27

Marcin Stawiski

Axiom of Choice in Proper and Distinguishing Colourings

Presentation not available

28

Milos Stojakovic

ZeroError ShiftCorrecting and ShiftDetecting Codes


29

Małgorzata Sulkowska

Maximizing the expected number of components in an online search of a graph


30

Ioannis Tasoulas

Counting Dyck paths with colored hills: a
bijective approach


31

James Tuite

Turán problems for kgeodetic digraphs


32

Maciej Ulas

Modulo 2 and 4 behavior of values of certain partition functions


33

Máté Vizer

On ordered Ramsey numbers of tripartite 3uniform hypergraphs


34

Yury Yarovikov

Spectra of firstorder sentences with quantifier depth 4


35

Maksim Zhukovskii

Stability of weak saturation number for bipartite graphs


36

Ferdinando Zullo

Intersection problem for linear sets in the projective line

