✦ LIBER ✦

Proof of a Conjecture of Bollob?s on Nested Cycles

✍ Scribed by Guantao Chen; Paul Erdós; William Staton

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 221 KB
Volume: 66
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0005

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

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

Proof of a Conjecture of Bollobás and Ko

Proof of a Conjecture of Bollobás and Kohayakawa on the Erdős–Stone Theorem

✍ Yoshiyasu Ishigami 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 242 KB

For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .

On a conjecture of bollobás and bosák

✍ Štefan Znám 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB

## Abstract It is shown that, for all sufficiently large __k__, the complete graph __K~n~__ can be decomposed into __k__ factors of diameter 2 if and only if __n__ ≥ 6__k__.

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

Graham's pebbling conjecture on products

Graham's pebbling conjecture on products of cycles

✍ David S. Herscovici 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract Chung defined a pebbling move on a graph __G__ to be the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number of a connected graph is the smallest number __f__(__G__) such that any distribution of __f__(__G__) pebbles on __G__

A Proof of Reutenauer's −q(n)Conjecture

✍ William F. Doran IV 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 181 KB

C. Reutenauer (Adv. in Math. 110 (1995), 234 246) has defined a new class of symmetric functions q \* indexed by partitions \*. He conjectures that for n 2, &q (n) is the sum of Schur symmetric functions. This paper provides a proof of his conjecture.