MPI-I-2003-1-009. March 2003, 29 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
Let $G$ be a simple graph on $n$ vertices. A conjecture of
Bollob\'as and Eldridge~\cite{be78} asserts that if $\delta (G)\ge {kn-1 \over
k+1}$
then $G$ contains any $n$ vertex graph $H$ with $\Delta(H) = k$.
We strengthen this conjecture: we prove that if $H$ is bipartite,
$3 \le \Delta(H)$ is bounded and $n$ is sufficiently large , then there exists
$\beta >0$ such that if $\delta (G)\ge {\Delta \over {\Delta +1}}(1-\beta)n$,
then
$H \subset G$.
Acknowledgement:
References to related material:
To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
---|---|
340 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |