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

Csaba, Bela

Local TagsRelease HistoryDetailsSummary

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

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

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2DD3-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2DD4-A

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Csaba, Bela¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

hide

Free keywords: -

Abstract: 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$.

Details

show

hide

Language(s): eng - English

Dates: Modified: 2004-06-17Date issued: 2003

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 201978
Other: Local-ID: C1256428004B93B8-6674AB6492ED6BE8C1256D1F0048AEF5-Csaba2003a

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Combinatorica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 23 Sequence Number: - Start / End Page: 35 - 72 Identifier: ISSN: 0209-9683