

Organizers
József Balogh, University of Szeged
Péter Hajnal, University of Szeged
Miloš Stojaković, University of Novi Sad
András Pluhár, University of Szeged
Location
Talks will take place in Seminar Room 220 of the
Institute of Informatics at the University of Szeged.
Informatikai Tanszékcsoport (Kalmár László Intézet)
6720 Szeged, Árpád tér 2.
6720 Szeged, Árpád tér 2.
Program A full list of abstracts is available here in pdf format. If you plan to participate, then please send an e-mail to József Balogh. |
|||||||||||||
March 7. Friday | |||||||||||||
12:00 | Lunch at Halászcsárda | ||||||||||||
13:30-14:20 | Géza Tóth (Rényi): Saturated topological graphs | ||||||||||||
14:35-15:25 |
Balázs Patkós (Rényi): Two Combinatorial Search Problems | ||||||||||||
15:40-16:00 | Rajko Nenadov (Novi Sad, ETH): Universality of random graphs | ||||||||||||
16:05-17:15 | Problem session, time for work | ||||||||||||
March 8. Saturday | |||||||||||||
10:20-11:10 | Miloš Stojaković (Novi Sad): Maker-Breaker H-game on random graphs | ||||||||||||
11:30-11:50 | András Pluhár (SZTE): Slowing down and accelerating games | ||||||||||||
12:00-12:20 | András London (SZTE): Slowing down and accelerating games | ||||||||||||
Lunch | |||||||||||||
13:50-14:10 | Maryam Sharifzadeh (UIUC): Subdivisions of a large clique in C6-free graphs | ||||||||||||
14:25-14:45 | László Ozsvárt (SZTE): Avoiding ordered graphs | ||||||||||||
15:00-15:20 | Ping Hu (UIUC): Mantel's Theorem for Random Hypergraphs | ||||||||||||
15:25-15:45 | Mirjana Mikalački (Novi Sad): Avoider-Enforcer star games | ||||||||||||
Conference bath at Mórahalom + work in the thermal bath | |||||||||||||
20:00 | Conference dinner at Mórahalom Babos Tanya | ||||||||||||
March 9. Sunday | |||||||||||||
10:20-10:40 | Hong Liu (UIUC): On the number of K4-saturating edges | ||||||||||||
11:00-11:20 | Péter Hajnal (SZTE): Combinatorics of poly-Bernoulli numbers | ||||||||||||
11:35-11:55 | Michelle Delcourt (UIUC): A Discrete Approach to Bernoulli Convolutions | ||||||||||||
12:00-12:20 | Jan Volec (Warwick): Subcubic triangle-free graphs have fractional chromatic number at most 14/5 | ||||||||||||
Lunch
14:00-14:20 |
Marko Savić (Novi Sad):
Linear time algorithm for optimal feed-link placement
|
14:35-14:55 |
Béla Csaba (SZTE): Packing
|
15:10-15:30 |
Mladen Kovačević (Novi Sad):
Error-correcting codes in spaces of multisets
|
15:45-16:05 |
Balázs Udvari (SZTE):
A generalization of convexity
|
16:10-17:05 |
Gábor Kun (Rényi):
Approximation of property (T) groups and expanders
|
| |



This conference is supported by Marie Curie FP7-PEOPLE-2012-IIF 327763
and by
TÁMOP-4.2.2.A-11/1/KONV-2012-0073,
Telemedicine Oriented Research in the Fields of Mathematics, Informatics and Medical Sciences