Abstract
Graph and Hypergraph Extremal Problems Related to Cycles
Ervin Gyori
Renyi Institute of Mathematics
After a survey of earlier related results, the following problems will
be covered:
What is the maximum number of triangles in pentagon-free graphs?
What is the maximum number of edges in a 3-uniform hypergraph not
containing any pentagon?
What is the maximum number of triangles in a graph not containing any
cycle of length 2k+1?
What is the maximum number of edges in a 3-uniform hypergraph not
containing any cycle of length 2k+1?
Extensions to k-uniform and non-uniform hypergraphs will be studied too.
be covered:
What is the maximum number of triangles in pentagon-free graphs?
What is the maximum number of edges in a 3-uniform hypergraph not
containing any pentagon?
What is the maximum number of triangles in a graph not containing any
cycle of length 2k+1?
What is the maximum number of edges in a 3-uniform hypergraph not
containing any cycle of length 2k+1?
Extensions to k-uniform and non-uniform hypergraphs will be studied too.
No video available