Campus Event Calendar
Event Entry
New for: D3
What and Who
On Embedding Spanning Subgraphs
Bela Csaba
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 27 November 2000
13:30
30 Minutes
46.1
024
Saarbrücken
Abstract
We will consider the following type of problem: given graphs G and H
on the same number of vertices, what conditions have to be imposed so
as to ensure that H is a subgraph of G. Finding a perfect matching or
Hamilton cycle are such embedding problems. We will discuss conditions
for embedding more general graphs, and survey old and recent results.
If time allows, we will give some rough ideas on the proofs.
Contact
Bela Csaba
128
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
extremal graph theory; subgraphs; Bollobas-Eldridge conjecture