Related papers: On the extremal graphs in generalized Tur\'an prob…

The generalized Tur\'an number $\text{ex}(n,H,\mathcal{F})$ denotes the maximum number of copies of $H$ in an $n$-vertex graph which contains no copies of any graph in a family $\mathcal{F}$ of graphs. The generalized rational exponents…

Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices is denoted by $ex(n,H,F)$. We investigate the function $ex(n,H,kF)$, where $kF$ denotes $k$ vertex disjoint copies of a fixed…

Let $\mathcal{H}$ be a family of graphs. The generalized Tur\'an number $ex(n, K_r, \mathcal{H})$ is the maximum number of copies of the clique $K_r$ in any $n$-vertex $\mathcal{H}$-free graph. In this paper, we determine the value of…

Let $\mathcal{H}$ be a hypergraph and $F$ be a graph. If there exists a bijection between the hyperedges of $\mathcal{H}$ and the edges of $F$ such that each hyperedge contains its image, then we say that $\mathcal{H}$ is a \textit{Berge…

In a generalized Tur\'an problem, two graphs $H$ and $F$ are given and the question is the maximum number of copies of $H$ in an $F$-free graph of order $n$. In this paper, we study the number of double stars $S_{k,l}$ in triangle-free…

Fix graphs $F$ and $H$. Let $\mathrm{ex}(n,H,F)$ denote the maximum number of copies of a graph $H$ in an $n$-vertex $F$-free graph. In this note we will give a new general supersaturation result for $\mathrm{ex}(n,H,F)$ in the case when…

In a generalized Tur\'an problem, we are given graphs $H$ and $F$ and seek to maximize the number of copies of $H$ in an $F$-free graph of order $n$. We consider generalized Tur\'an problems where the host graph is planar. In particular we…

The \textit{generalized Tur\'an number} $\mathrm{ex}(n, T, F)$ is the maximum possible number of copies of $T$ in an $F$-free graph on $n$ vertices for any two graphs $T$ and $F$. For the book graph $B_t$, there is a close connection…

Generalized Tur\'an problems ask for the maximum number of copies of a graph $H$ in an $n$-vertex, $F$-free graph, denoted by ex$(n,H,F)$. We show how to extend the new, localized approach of Brada\v{c}, Malec, and Tompkins to generalized…

A classical extremal, or Tur\'an-type problem asks to determine ${\rm ex}(G, H)$, the largest number of edges in a subgraph of a graph $G$ which does not contain a subgraph isomorphic to $H$. Alon and Shikhelman introduced the so-called…

As a variant of the famous Tur\'an problem, we study $\mathrm{rex}(n,F)$, the maximum number of edges that an $n$-vertex regular graph can have without containing a copy of $F$. We determine $\mathrm{rex}(n,K_{r+1})$ for all pairs of…

The generalized Tur\'{a}n number $ex(n,K_s,H)$ is defined to be the maximum number of copies of a complete graph $K_s$ in any $H$-free graph on $n$ vertices. Let $F$ be a linear forest consisting of $k$ paths of orders…

For two graphs $J$ and $H$, the generalized Tur\'{a}n number, denoted by $ex(n,J,H)$, is the maximum number of copies of $J$ in an $H$-free graph of order $n$. A linear forest $F$ is the disjoint union of paths. In this paper, we determine…

Let \( \mathcal{F} \) be a family of graphs. The generalized Tur\'an number \( \operatorname{ex}(n, K_r, \mathcal{F}) \) is the maximum number of $K_r$ in an \( n \)-vertex graph that does not contain any member of \( \mathcal{F} \) as a…

Given a graph $F$, the $r$-expansion $F^r$ of $F$ is the $r$-uniform hypergraph obtained from $F$ by inserting $r-2$ new distinct vertices in each edge of $F$. Given $r$-uniform hypergraphs $\mathcal{H}$ and $\mathcal{F}$, the generalized…

Fix a graph $F$. We say that a graph is {\it $F$-free} if it does not contain $F$ as a subgraph. The {\it Tur\'an number} of $F$, denoted $\mathrm{ex}(n,F)$, is the maximum number of edges possible in an $n$-vertex $F$-free graph. The study…

For a family of graphs $\cal F$, a graph $G$ is $\cal F$-free if it does not contain a member of $\cal F$ as a subgraph. The Tur\'an number $\textrm{ex}(n,{\cal F})$ is the maximum number of edges in an $n$-vertex graph which is $\cal…

Let $\mathscr{F}$ be a family of graphs. A graph $G$ is $\mathscr{F}$-free if $G$ does not contain any $F\in \mathscr{F}$ as a subgraph. The Tur\'an number, denoted by $ex(n, \mathscr{F})$, is the maximum number of edges in an $n$-vertex…

The generalized Tur\'an number for $H$ of $G$, denoted by $\ex(n,H,G)$, is the maximum number of copies of $H$ in an $n$-vertex $G$-free graph. When $H$ is an edge, $\ex(n,H,G)$ is the classical Tur\'an number $\ex(n,G)$. Let $P_k$ be the…

In this paper we introduce a unifying approach to the generalized Tur\'an problem and supersaturation results in graph theory. The supersaturation-extremal function $satex(n, F : m, G)$ is the least number of copies of a subgraph $G$ an…