اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe number of cliques in graphs of given order and size
75
0
0.0
(
0
)
تأليف
Vladimir Nikiforov
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let k_r(n,m) denote the minimum number of r-cliques in graphs with n vertices and m edges. For r=3,4 we give a lower bound on k_r(n,m) that approximates k_r(n,m) with an error smaller than n^r/(n^2-2m). The solution is based on a constraint minimization of certain multilinear forms. In our proof, a combinatorial strategy is coupled with extensive analytical arguments.
قيم البحث
اقرأ أيضاً
What is the minimum number of triangles in a graph of given order and size? Motivated by earlier results of Mantel and Turan, Rademacher solved the first non-trivial case of this problem in 1941. The problem was revived by ErdH{o}s in 1955; it is now
known as the ErdH{o}s-Rademacher problem. After attracting much attention, it was solved asymptotically in a major breakthrough by Razborov in 2008. In this paper, we provide an exact solution for all large graphs whose edge density is bounded away from~$1$, which in this range confirms a conjecture of Lovasz and Simonovits from 1975. Furthermore, we give a description of the extremal graphs.
We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge density is suf
ficiently large. We also investigate a variant of this problem, when the host graph is bipartite.
Given a digraph $D$ with $m$ arcs and a bijection $tau: A(D)rightarrow {1, 2, ldots, m}$, we say $(D, tau)$ is an antimagic orientation of a graph $G$ if $D$ is an orientation of $G$ and no two vertices in $D$ have the same vertex-sum under $tau$, wh
ere the vertex-sum of a vertex $u$ in $D$ under $tau$ is the sum of labels of all arcs entering $u$ minus the sum of labels of all arcs leaving $u$. Hefetz, M{u}tze, and Schwartz in 2010 initiated the study of antimagic orientations of graphs, and conjectured that every connected graph admits an antimagic orientation. This conjecture seems hard, and few related results are known. However, it has been verified to be true for regular graphs, biregular bipartite graphs, and graphs with large maximum degree. In this paper, we establish more evidence for the aforementioned conjecture by studying antimagic orientations of graphs $G$ with independence number at least $|V(G)|/2$ or at most four. We obtain several results. The method we develop in this paper may shed some light on attacking the aforementioned conjecture.
Determine the size of $r$-graphs with given graph parameters is an interesting problem. Chvatal and Hanson (JCTB, 1976) gave a tight upper bound of the size of 2-graphs with restricted maximum degree and matching number; Khare (DM, 2014) studied the
same problem for linear $3$-graphs with restricted matching number and maximum degree. In this paper, we give a tight upper bound of the size of $3$-graphs with bounded codegree and matching number.
Motivated by work of ErdH{o}s, Ota determined the maximum size $g(n,k)$ of a $k$-connected nonhamiltonian graph of order $n$ in 1995. But for some pairs $n,k,$ the maximum size is not attained by a graph of connectivity $k.$ For example, $g(15,3)=77$
is attained by a unique graph of connectivity $7,$ not $3.$ In this paper we obtain more precise information by determining the maximum size of a nonhamiltonian graph of order $n$ and connectivity $k,$ and determining the extremal graphs. Consequently we solve the corresponding problem for nontraceable graphs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
