On extremal numbers of the triangle plus the four-cycle

For a family $\mathcal {F}$ of graphs, let ${\mathrm {ex}}(n,\mathcal {F})$ denote the maximum number of edges in an n-vertex graph which contains none of the members of $\mathcal {F}$ as a subgraph. A longstanding problem in extremal graph theory asks to determine the function...

Full description