On the maximum density of fixed strongly connected subtournaments
نویسندگان
چکیده
In this paper, we study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for three tournaments as well as extremal families for each tournament. We use Razborov’s semidefinite method for flag algebras to prove the upper bounds.
منابع مشابه
Vertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebitz
It was proved Bessy et al., 2010 that for r ≥ 1, a tournament with minimum semidegree at least 2r − 1 contains at least r vertex-disjoint directed triangles. It was also proved Lichiardopol, 2010 that for integers q ≥ 3 and r ≥ 1, every tournament with minimum semidegree at least q − 1 r − 1 contains at least r vertex-disjoint directed cycles of length q. None information was given on these dir...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملFixed Point Theory in $varepsilon$-connected Orthogonal Metric Space
The existence of fixed point in orthogonal metric spaces has been initiated by Eshaghi and et. al [7]. In this paper, we prove existence and uniqueness theorem of fixed point for mappings on $varepsilon$-connected orthogonal metric space. As a consequence of this, we obtain the existence and uniqueness of fixed point for analytic function of one complex variable. The paper concludes with some i...
متن کاملStrong subtournaments of multipartite tournaments
An orientation of a complete graph is a tournament, and an orientation of a complete n-partite graph is an n-partite tournament. For each n 2:: 4, there exist examples of strongly connected n-partite tournament without any strongly connected subtournaments of order p 2:: 4. If D is a digraph, then let d+ (x) be the out degree and d(x) the indegree of the vertex x in D. The minimum (maximum) out...
متن کاملALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.05200 شماره
صفحات -
تاریخ انتشار 2015