Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to edge-weighted digraphs: if every vertex has out-weight at least 1 then the digraph contains a path of weight at least 1. We also give several related conjectures and results concerning heavy cycles in e
A note concerning paths and independence number in digraphs
✍ Scribed by Geňa Hahn; Bill Jackson
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 169 KB
- Volume
- 82
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We show that there exist digraphs D such that for all paths P, and P2 we have cu(D (P, U PJ) = a(D) and point to a generalization.
📜 SIMILAR VOLUMES
Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced
It is shown that the interpretation of quantum mechanics as a theory describing systems for which their propositions are always valid or not leads t o a contradiction within the theory. The proof does not depend on any specific property of measurements, but only the usual description of ensembles of
## Abstract Mader conjectured that for all $\ell$ there is an integer $\delta^+(\ell)$ such that every digraph of minimum outdegree at least $\delta^+(\ell)$ contains a subdivision of a transitive tournament of order $\ell$. In this note, we observe that if the minimum outdegree of a digraph is suf