Geometry, Structure and Randomness in Combinatorics

A Unifying Approach to Graph Limits II

speaker: Jaroslav Nesetril (Charles University, Prague)

abstract: We investigate graph limits in the framework of $$X$$-convergence for fragments of $$F_0$$-logic. We describe various limit constructions and particularly indicate the limits of bounded hight colered trees and graphs with bounded tree depth. These may be the first limits of sparse graphs with unbounded degrees.

timetable:
Fri 7 Sep, 10:30 - 11:30, Aula Dini
<< Go back