Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree 
three

Csaba, Bela

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three

MPS-Authors

/persons/resource/persons44270

Csaba, Bela
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Csaba, B. (2003). Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three. Combinatorica, 23, 35-72.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2DD3-C

要旨

Let $G_1$ and $G_2$ be simple graphs on $n$ vertices. If there are edge-disjoint copies of $G_1$ and $G_2$ in $K_n$, then we say there is a packing of $G_1$ and $G_2$. A conjecture of Bollob\'as and Eldridge ~\cite{be78} asserts that if $(\Delta(G_1)+1)(\Delta(G_2)+1)\le n+1$ then there is a packing of $G_1$ and $G_2$. We prove this conjecture when $\Delta(G_1)=3$, for sufficiently large $n$.