اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Caccetta-Haggkvist Conjecture
204
0
0.0
(
0
)
تأليف
Dhananjay P. Mehendale
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that we cannot avoid the existence of at least one directed circuit of length less than or equal to (n/r) in a digraph on n vertices with out-degree greater than or equal to r. This is well-known Caccetta-Haggkvist problem.
قيم البحث
اقرأ أيضاً
We propose an algorithm to reduce a k-chromatic graph to a complete graph of largest possible order through a well defined sequence of contractions. We introduce a new matrix called transparency matrix and state its properties. We then define correct
contraction procedure to be executed to get largest possible complete graph from given connected graph. We finally give a characterization for k-chromatic graphs and use it to settle Hadwigers conjecture.
We settle the Path Decomposition Conjecture (P.D.C.) due to Tibor Gallai for minimally connected graphs, i.e. trees. We use this validity for trees and settle the P. D. C. using induction on the number of edges for all connected graphs. We then obtai
n a new bound for the number of paths in a path cover in terms of the number of edges using idea of associating a tree with a connected graph. We then make use of a spanning tree in the given connected graph and its associated basic path cover to settle the conjecture of Tibor Gallai in an alternative way. Finally, we show the existence of Hamiltonian path cover satisfying Gallai bound for complete graphs of even order and discuss some of its possible ramifications.
Let $lambda(m)$ be the $m$th coefficient of a modular form $f(z)=sum_{mgeq 1} lambda(m)q^m$ of weight $kgeq 4$, let $p^n$ be a prime power, and let $varepsilon>0$ be a small number. An approximate of the Atkin-Serre conjecture on the lower bound of t
he form $left |lambdaleft (p^nright )right | geq p^{(k-1)n/2-2k+2varepsilon}$ is presented in this note.
Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the Collatz co
njecture based on bit representation of integers. The scheme neither encounters any cycles in the so called Collatz sequence and nor the sequence grows indefinitely. Experimental results show that the Collatz sequence starting at the given integer , oscillates for finite number of times, never exceeds 1.7 times (scaling factor) size of the starting integer and finally reaches the value 1. The experimental results show strong evidence that conjecture is correct and paves a way for theoretical proof.
We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemanns function in the domain that goes from 2 to 1010 at least. Instead of usi
ng a constant as was done by Legendre and others in the formula of Gauss, we try to adjust the data through a function. This function has the remarkable property: its points of discontinuity are the prime numbers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
