## Classifying degenerate $\{2,3\}$-hypergraphs and 2-colored graphs

- April 8, 2016
- 2:30 p.m.
- LeConte 312

## Abstract

A hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\subseteq 2^V$. Here the edges of $E$ could have different cardinalities. The set of all the cardinalities of edges in $H$ is denoted by $R(H)$, the set of edge types. A hypergraph H is called degenerate if its Tur\'an density is $|R(H)|-1$. I am working on classifying all degenerate hypergraphs of $\{2,3\}$ types. Also, what's the degenerate graphs of 2-colored graphs, a 2-colored graph is a graph whose edges are colored by two colors.