Document Type
Lecture
Publication Date
3-9-2016
Abstract
Denote by ex (n, H) the classical Turán number, i.e., the maximum number of edges among all H-free graphs with n vertices. Given p > 0 and a graph G whose degree sequence is d1, d2,...,dn, let ep(G)= n i=1dp i .Caro and Yuster introduced a Turán-type problem for ep(G): given p > 0, how large can ep(G) be if G has no subgraph of a particular type. Denote by exp (n, H)the maximum value of ep(G) taken over all graphs with n vertices that do not contain H as a subgraph. The k-uniform hypergraph Turán Number of a family F of k-uniform hypergraphs is defined as follows: exk (n, F) = max e(H) : V(H) =n, G F,G H . In this talk, we will present some results on exp (n, H) and exk (n, F), for some special H and F.
Relational Format
presentation
Recommended Citation
Shi, Yongtang, "Some Extremal Problems of Graphs and Hypergraphs" (2016). Combinatorics Seminar. 27.
https://egrove.olemiss.edu/math_combinatorics/27
