𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof of a conjecture of Häggkvist on cycles and independent edges

✍ Scribed by Kenneth A. Berman

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
196 KB
Volume
46
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

A graph G of order n is a ck-graph if for every pair of d~tinct, nonadlacenl veJtlces x and y' d(x)+d(y)>~n+k where d(v) denotes the degree of a vertex v In this paper, we prove the

📜 SIMILAR VOLUMES

Proof of a Conjecture of Bollob?s on Nes
Proof of a Conjecture of Bollob?s on Nested Cycles
✍ Guantao Chen; Paul Erdós; William Staton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1

Proof of a conjecture on cycles in a bip
Proof of a conjecture on cycles in a bipartite graph
✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

On a conjecture of Aris: Proof and remar
On a conjecture of Aris: Proof and remarks
✍ Dan Luss; Neal R. Amundson 📂 Article 📅 1967 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 428 KB 👁 2 views
Proof of a conjecture on game domination
Proof of a conjecture on game domination
✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume

Proof of a conjecture on Genocchi number
Proof of a conjecture on Genocchi numbers
✍ John Riordan; Paul R. Stein 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 446 KB

In [ I ]I, Gandhi has stated the following conjecture on Genocchi numbl:rs: ## . z;(t~-I)~ . The meaning of the odd notation on the 1e:ft of (1) is as follows: write . . . C(k+n-1)2 ; then ## K(n+l,k)=k2K(n,k+lj-(k-l)2~(~~,k~ K(1,k)=k2-(k-1;j2 =2k--1 alId, af course, (1) is restated as (1')