Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1157.05032
Csaba, Béla
On embedding well-separable graphs. (English)
[J] Discrete Math. 308, No. 19, 4322-4331 (2008). ISSN 0012-365X

This paper is about guaranteeing that a given graph $H$ is a subgraph of an arbitrary graph $G$. The author considers graphs $H$ that are ``far from being an expander", namely $H$ is well-separable if there is a subset $S \subset V(H)$ of size $o(n)$ such that all components of $H-S$ are of size $o(n)$. Let $\Delta$ denote the maximum degree of $H$ and $\chi$ its chromatic number. The author shows that if $H$ is well-seperable, then for every $\Delta$ and $\gamma > 0$ there exists an $n_0$ such that if $G$ is of order $n \ge n_0$ and minimum degree $\delta(G) \ge (1 - 1/(2(\chi -1)) + \gamma)n$, one gets $H \subset G$. This work can be considered as a generalization of Turán's Theorem, as well of a generalization of work by Erdös-Stone-Simonovits.
[Dan S. Archdeacon (Burlington)]

MSC 2000:: *05C35 Extremal problems (graph theory)
05C10 Topological graph theory

Keywords: subgraph; well-separable; extremal graph theory

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]