✦ LIBER ✦

The Extremal Function for Complete Minors

✍ Scribed by Andrew Thomason

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 190 KB
Volume: 81
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.2013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal functions for rooted minors

✍ Paul Wollan 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

## Abstract The graph __G__ contains a graph __H__ as a __minor__ if there exist pairwise disjoint sets {__S__~__i__~ ⊆ __V__(__G__)|__i__ = 1,…,|__V__(__H__)|} such that for every __i__, __G__[__S__~__i__~] is a connected subgraph and for every edge __uv__ in __H__, there exists an edge of __G__ w

An extremal function for digraph subcont

An extremal function for digraph subcontraction

✍ Jagger, Chris 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

We determine, to within a constant factor, the maximum size of a digraph which has no subcontraction to the complete digraph DK, of order p. Let d(p) be defined for positive integers p by d(p) = inf{c; e(D) 2 clDI implies D % DK,}, where D denotes a digraph, and + denotes contraction. We show that 0

Extremal Digraph Results for Topological

Extremal Digraph Results for Topological Complete Subgraphs

✍ C. Jagger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We determine, to within a constant factor, the maximum size of a digraph that does not contain a topological complete digraph DK p of order p. Let t 1 ( p) be defined for positive p by where D denotes a digraph. We show that 1 16 p 2 < t 1 ( p) ≤ 44 p 2 . We also obtain results for containing topol

Extremal results for rooted minor proble

Extremal results for rooted minor problems

✍ Leif K Jørgensen; Ken-ichi Kawarabayashi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract In this article, we consider the following problem. Given four distinct vertices __v__~1~,__v__~2~,__v__~3~,__v__~4~. How many edges guarantee the existence of seven connected disjoint subgraphs __X__~i~ for __i__ = 1,…, 7 such that __X__~j~ contains __v__~j~ for __j__ = 1, 2, 3, 4 and

Extremal Problems for Sets Forming Boole

Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs

✍ David S. Gunderson; Vojtěch Rödl; Alexander Sidorenko 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Three classes of finite structures are related by extremal properties: complete d-partite d-uniform hypergraphs, d-dimensional affine cubes of integers, and families of 2 d sets forming a d-dimensional Boolean algebra. We review extremal results for each of these classes and derive new ones for Bool

Extremal problems concerning transformat

Extremal problems concerning transformations of the edges of the complete hypergraphs

✍ Yair Caro 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

We consider extremal problems concerning transformations of the edges of complete hypergraphs. We estimate the order of the largest subhypergraph K such that for every edge e E €(K), f(e) e f ( K ) , assuming f(e) # e. Several extensions and variations of this problem are also discussed here.