相关论文: On the maximum induced density of directed stars a…

We consider three extremal problems about the number of copies of a fixed graph in another larger graph. First, we correct an error in a result of Reiher and Wagner and prove that the number of $k$-edge stars in a graph with density $x \in…

We consider the problem of determining the maximum induced density of a graph H in any graph on n vertices. The limit of this density as n tends to infinity is called the inducibility of H. The exact value of this quantity is known only for…

Let $C(n)$ denote the maximum number of induced copies of 5-cycles in graphs on $n$ vertices. For $n$ large enough, we show that $C(n)=a\cdot b\cdot c \cdot d \cdot e + C(a)+C(b)+C(c)+C(d)+C(e)$, where $a+b+c+d+e = n$ and $a,b,c,d,e$ are as…

We consider the Densest-Subgraph problem, where a graph and an integer k is given and we search for a subgraph on exactly k vertices that induces the maximum number of edges. We prove that this problem is NP-hard even when the input graph…

In the area of extremal graph theory, there exists a problem that investigates the maximum induced density of a $k$-vertex graph $H$ in any $n$-vertex graph $G$. This is known as the problem of \emph{inducibility} that was first introduced…

We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…

The $(\kappa,\ell)$-edge-inducibility problem asks for the maximum number of $\kappa$-subsets inducing exactly $\ell$ edges that a graph of given order $n$ can have. Using flag algebras and stability approach, we resolve this problem for…

We consider the problem of maximizing the number of induced copies of an oriented star $S_{k,\ell}$ in digraphs of given size, where the center of the star has out-degree $k$ and in-degree $\ell$. The case $k\ell=0$ was solved by Huang.…

We use Razborov's flag algebra method to show an asymptotic upper bound for the maximal induced density $i(\vec P_3)$ of the orgraph $\vec P_3$ in an arbitrary orgraph. A conjecture of Thomass\'e states that $i(\vec P_3)=2/5$. The hitherto…

The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…

Given a $k$-vertex graph $H$ and an integer $n$, what are the $n$-vertex graphs with the maximum number of induced copies of $H$? This question is closely related to the inducibility problem introduced by Pippenger and Golumbic in 1975,…

Fix $k\ge 11$ and a rainbow $k$-clique $R$. We prove that the inducibility of $R$ is $k!/(k^k-k)$. An extremal construction is a balanced recursive blow-up of $R$. This answers a question posed by Huang, that is a generalization of an old…

The upper density of an infinite graph $G$ with $V(G) \subseteq \mathbb{N}$ is defined as $\overline{d}(G) = \limsup_{n \rightarrow \infty}{|V(G) \cap \{1,\ldots,n\}|}/{n}$. Let $K_{\mathbb{N}}$ be the infinite complete graph with vertex…

Let $H$ be a graph on $n$ vertices and let the blow-up graph $G[H]$ be defined as follows. We replace each vertex $v_i$ of $H$ by a cluster $A_i$ and connect some pairs of vertices of $A_i$ and $A_j$ if $(v_i,v_j)$ was an edge of the graph…

The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If every vertex is replaced with the same number of copies,…

Inspired by the work of Backelin on non-commutative correspondences to Macaulay's theorem of the growth of the Hilbert series of affine algebras, we study embedding dimension dependant versions of his degree 2 to degree 3 result. In…

For a graph $G$ and $e\in [0,1]$, denote by $I_G(e)$ the supremum of densities of $G$ over $n$-vertex graphs with edge density $e$ as $n$ goes to infinity. Liu, Mubayi and Reiher asked if there exists a graph $G$, where $I_G(e)$ has a…

Let $H$ be a graph on $h$ vertices. The number of induced copies of $H$ in a graph $G$ is denoted by $i_H(G)$. Let $i_H(n)$ denote the maximum of $i_H(G)$ taken over all graphs $G$ with $n$ vertices. Let $f(n,h) = \Pi_{i}^h a_i$ where…

Let d_i(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadruples (d_0,d_1,d_2,d_3) that are arbitrary close to 3-vertex…

We investigate the number of 4-edge paths in graphs with a fixed number of vertices and edges. An asymptotically sharp upper bound is given to this quantity. The extremal construction is the quasi-star or the quasi-clique graph, depending…