'Regularity lemma' presentation slideshows

Regularity partitions and the topology of graphons

385 views • 26 slides

Packing directed cycles efficiently

Packing directed cycles efficiently. Zeev Nutov Raphael Yuster. Definitions and notations. Given a digraph G , how many arc-disjoint cycles can be packed into G ? Max number of arc-disjoint cycles in G = cycle packing number ? c ( G ) of G .

302 views • 18 slides

Integer and fractional packing of graph families

Integer and fractional packing of graph families. Raphael Yuster. Definitions and notations. Let F be any (finite or infinite) family of finite graphs. The F -packing number of a graph G , denoted ? ( F , G ), is the maximum number of edge disjoint elements of F in G.

232 views • 16 slides

The number of orientations having no fixed tournament

The number of orientations having no fixed tournament. Noga Alon Raphael Yuster. Definitions. Let T be a tournament. Let G be an undirected graph. Define: D ( G , T ) = # orientations of G that are T -free D ( n , T ) = max D ( G , T ) where G has n vertices Example:. G.

113 views • 11 slides