Liana Yepremyan

Turán numbers of extensions

Abstract The extension of an r-uniform hypergraph G is obtained from it by adding for every pair of vertices of G , which is not covered by an edge in G , an extra edge containing this pair and ( r − 2 ) new vertices. Keevash [3] and Sidorenko [9] have previously determined Turan densities of two families of hypergraph extensions. We determine the Turan numbers for these families, using classical stability techniques and new tools introduced in [5] .

The extremal function for disconnected minors

For a graph

Complete graph immersions and minimum degree

H

Sparse halves in dense triangle-free graphs

let

Turán number of generalized triangles

c(H)

Interval edge-colorings of graph products

denote the supremum of

Rainbow Matchings in Properly Colored Multigraphs

|E(G)|/|V(G)|

Supersaturation of Even Linear Cycles in Linear Hypergraphs

taken over all non-null graphs

Rainbow factors in hypergraphs

G

On the number of symbols that forces a transversal.

not containing