Graph Minor Theory

Basic concepts and Definitions
Achievements and remarkable works

Extremal problems and results
Other approaches
Signed graphs and minors
Sketch of proofs
Graph Minor Theory

Bahman Ghandchi
Institute for Advanced Studies in Basic Sciences (IASBS)
ICTP, Trieste
September 11, 2012
Institute for Advanced Studies
in asic Sciences
Gava Zang, anjan, Iran
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Table of contents

Edge contraction
Minor
Topological minor

Interesting works and results
Hadwiger conjecture
Hajos conjecture
Wagner conjecture

Mader works and related results
Ks,t Minor free graphs
Extremal results containing Girth
Other approaches
Probabilistic methods and Hajos conjecture

Signed graphs
Sketch of proofs
Kt
K2,t
Ks,t
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Edge contraction
Minor
Topological minor
Edge contraction
Definition (edge contraction)
Let e = xy be an edge of a graph G = (V, E). By G/e we denote
the graph obtained from G by contracting the edge e into a new
vertex ve , which becomes adjacent to all the former neighbours of
x and of y.
Formally G/e is a graph (V 0 , E 0 ) with vertex set
V 0 := (V \{x, y }) {ve }
(where ve is the new vertex, i.e. ve
/ V E ) and edge set:
0
E := {vw E | {x, y } {v , w } = }
{ve w | xw E \ {e} or yw E \ {e} } .
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Edge contraction
Minor
Topological minor
Minor
Definition (minor)
A graph H is a minor of a graph G if a graph isomorphic to H can
be obtained from a subgraph of G by contracting edges[2].
Definition (another minor definition)
Any graph H that can be produced from G by successive
application of these reductions is called a minor of G:
(a) delete an edge,
(b) contract an edge,
(c) delete an isolated node.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Edge contraction
Minor
Topological minor
Topological minor
Definition (topological minor)
A graph H is called a topological minor of a graph G if a
subdivision of H is isomorphic to a subgraph of G.
Theorem
every topological minor of a graph is also its (ordinary) minor.
Theorem
every minor with maximum degree at most 3 of a graph is also its
topological minor.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Hadwiger conjecture
Hajos conjecture
Wagner conjecture

During the past decades graphs minors theory has been developed
so well that one can name the series of papers by Robertson and
Seymour(Graph Minors I...XXIII) as the most important work in
graph theory. many interesting results and approaches are present,
just to name a few we have the following short list:
algorithmic aspects: finding O(n3 ) algorithm for solving
k-Disjoint path problem for fixed k.
algorithmic aspects: if we bound tree-width of instances of
many NP-hard problems we can solve those in poly-time.
Wagner conjecture:For every minor-closed family of graphs
the set of forbidden minors is finite.
probabilistic methods: Hajos conjecture disproof and recent
works in proving it for large girth.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Hadwiger conjecture
Hajos conjecture
Wagner conjecture
Hadwiger conjecture
One of the most important and challenging open problems in
graph theory is Hadwigers conjecture:
Conjecture (Hadwiger 1943)
for every integer r > 0 and every graph G:
(G ) r G Kr
key facts:
this conjecture is true for r < 7 and still open for greater
values.
as (Kt,t ) = 2 Kt,t Kt nothing can be said conversely.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Hadwiger conjecture
Hajos conjecture
Wagner conjecture
Hajos conjecture
The Hajos conjecture is a strengthened version of Hadwiger
conjecture which states:
Conjecture (Hajos)
for every integer r > 0 and every graph G:
(G ) r G t Kr
Key facts about this conjecture:
Hajos conjecture has been failed in general.
conjecture is true for r 4 and false for r 7 and cases 5 &
6 are still open.
Erdos has showed with probabilistic methods that almost
every graph which is large enough is a counter example for
this conjecture.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Hadwiger conjecture
Hajos conjecture
Wagner conjecture
Wagner conjecture
Wagner conjecture or as it is known today (Robertson Seymour
theorem) is one of the most important works in graph theory in
past decades. the theorem states:
Theorem
For every minor-closed family of graphs the set of forbidden minors
is finite.
this theorem generalizes the planar graphs theorem in which we
have K5 &K3,3 as forbidden minors.
a variation of this theorem is for being linklessly embeddable:
Theorem
A graph is linklessly embeddable if and only if it does not contain
any of the seven graphs in Petersen family as a minor.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Hadwiger conjecture
Hajos conjecture
Wagner conjecture
Wagner conjecture
The Petersen family

Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Hadwiger conjecture
Hajos conjecture
Wagner conjecture
Wagner conjecture
the following theorem is equivalent to this theorem which states
the set of all finite graphs with minor relation is well quasi ordered
Theorem
For every infinite sequence G1 , G2 , ... of graphs, there exist distinct
integers i < j such that Gi is a minor of Gj .
the proof of Wagners conjecture is one the main result from series
of 23 papers named Graph Minors I to Graph Minors XXIII
published by Robertson and Seymour from 80s to 2004. these
works are considered as one the most important projects in graph
theory.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Mader works
Mader has proved that for every graph H there is a constant CH
such that every graph G not containing H as a minor satisfies
|E (G )| CH |V (G )|, but determining the best possible constant
CH for a given graph H is a question that has been answered for
very few graphs H.
In fact Mader has shown that:
Theorem (Mader 1967)
There is a function h : N N such that every graph with average
degree at least h(r) contains Kr as a topological minor for every
r N.
The function obtained in this theorem is h(r ) = 2r (r 1)/2 .
as we will see in the following sections this bound is so loose.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Bounds for Kr (topological)minor free graphs

Two bounds for Kr (topological)minor free graphs have been found
and these bounds are sharp up to a constant c as a function of r.
Theorem (Bollobas & Thomason and independently Komlos &
Szemeredi)
There exists a c R such that, for every r N, every graph G of
average degree d(G ) > cr 2 contains Kr as a topological minor.
Theorem (Kostochka 1982; Thomason 1984[5])
There exists a c R such
that, for every r N, every graph G of
average degree d(G ) > cr log r contains Kr as a minor.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

K1,t minor free graphs

It is easy to see that every n-vertex graph with more than
1
2 (t 1)n edges contains K1,t as a minor (indeed, as a subgraph),
and if t divides n then there is an n-vertex graph with exactly
1
2 (t 1)n edges with no K1,t minor (the disjoint union of n/t
copies of Kt ).
The extremal example for above statement is not connected and
the answer when we restrict ourselves to connected graphs is
different.
Theorem (G. Ding, P. Seymour and T. Johnson, 2001)
Let t 3 and n t + 2 be integers. If G is an n-vertex connected
graph with no K1,t minor, then |E (G )| n + 21 t(t 3)
and for all n, t this is best possible.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

K2,t minor free graphs

Theorem (Chudnovsky, Reed and Seymour 2011[1])
Let t 2, and let G be a graph with n > 0 vertices and with no
K2,t minor. Then
1
|E (G )| (t + 1)(n 1)
2
.
key facts:
Myers had previously proved the theorem for all t 1029 .
the bound is best possible when n - 1 is a multiple of t.
for n = 32 t the bound is about 12 tn but the best known result
5
is 12
tn.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Ks,t minor free graphs

More generally, what is the maximum number of edges in graphs
with no Ks,t minor when s > 1? If we take a graph each
component of which is a clique of size t, and add s 1 more
vertices each adjacent to all others, then the resulting n-vertex
graph has no Ks,t minor, and the number of edges is :
(t + 2s + 3)(n s + 1)/2 + (s 1)(s 2)/2.
Key facts:
Kostochka and Prince have a proof of this for all sufficiently
large t.
it is open for s = 4, 5.
for s 6 Kostochka and Prince have counterexamples.
Kostochka and Prince proved the following:
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Ks,t minor free graphs

Theorem (A. Kostochka and N. Prince[3])
Let s,t be positive integers with t > (240s log2 s)8s log2 s+1 . Then
every graph with average degree at least t + 3s has a Ks,t minor,
and there are graphs with average degree at least t + 3s 5 s

that do not have a Ks,t minor.
Theorem (A. Kostochka[4])
let s and t be positive integers such that
t > t0 (s) := max 415s
2 +2
, (240s log2 (s))8s log2 s+1
-minor
then every (s+t)-chromatic graph has a ks,t
Bahman Ghandchi
Graph Minor Theory
(1)

Other approaches
Sketch of proofs

Minor and Girth

There are many results in minors theory which uses girth of a
graph just to name a few we have these two theorems. the
interesting fact is the second theorem shows that only big enough
girth can force certain minors with high minimum degree.
Theorem (Mader 1997)
For every graph H of maximum degree d 3 there exists an
integer k such that every graph G of minimum degree at least d
and girth at least k contains H as a topological minor.
Theorem (Thomassen 1983)
Given an integer k, every graph G with girth g (G ) 4k 3 and
(G ) 3 has a minor H with (H) k.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs

Using the chernoff bound we have the following result:
Theorem (Erdos, Fajtlowicz)
For n sufficiently large there exists graphs with chromatic number
n
at least 2log
n and no topological minor of K8 n .
2
majority of large graphs are counterexamples.

we should have n 230
Hajos conjecture is true for large girth.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Theorem (Kuhn, Osthus 2006)

Let r 1 be a natural number. Every graph of minimum degree at
least r and girth at least 27 contains a subdivision of Kr +1 .
Its a fact that every kchromatic graph has a subgraph with
minimum degree at least k 1. So combining this fact and the
above theorem we have a weakened version of Hajos conjecture
which is true.
Theorem
If G is graph with girth(G ) 27 and (G ) = k the G has a
topological minor of Kk .
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Signed graphs
Signed graphs
A graph G with a subset of its edges S E (G ) is called a sigend

graph. Edges that are in S are negative and edges which are not
are positive. A resigning operation at any vertex is allowed so a
signed graph is not a single graph but a family of graphs.
(G , S)
Bahman Ghandchi
Graph Minor Theory
(2)

Other approaches
Sketch of proofs
Signed graphs
Signed minors
A signed graph (G1 , S1 ) is called a signed minor of (G2 , S2 ) if it

can be obtained from (G2 , S2 ) from a sequence of following
operations:
Vertex deletion
Edge deletion
Resigning
Contraction on positive edges
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
Kt minor free graphs sketch of proof
The main result discussed here is by Thomason and is as follows:

Theorem (Kostochka 1982; Thomason 1984[5])
There exists a c R such
that, for every r N, every graph G of
average degree d(G ) > cr log r contains Kr as a minor.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
Suppose that the function below is defined for every integer p

where G is a graph:
c(p) = inf{c|G ; |E (G )| c|V (G )| G Kp },
It will be shown that for large p we have:
p
c(p) 2.68p log p
Define real number by = 1 + log 2; then = 2.678
Bahman Ghandchi
Graph Minor Theory
(3)
(4)

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

Lemma
let r = {G ||V (G )| r 2(G ) br c 3}, where r is real and
r 3 is an integer. if G r implies G Kp2 then c(p) r
First we choose a graph H1 which is minor minimal in the set
{G ||E (G )| r |V (G )|}.
(5)
We will show that G Kp .

Then a vertex of minimum degree such as z is chosen in H1 . Let
H2 = H1 |N(z) it is easy to show that (H2 ) r .
next step is to show H2 Kp1 .
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

Let set D and function f on set of finite graphs be defines as
follows:
f (G ) = r |V (G )|(log(|V (G )|/r ) + 1)/2.
(6)
and
D = {G ||V (G )| r |E (G )| f (G )}.
(7)
By definition of H2 D. Let H be a minor of H2 which is minor

minimal in the set D.
Next we choose a vertex u V (H) such that dH (u) = (H) and
put G = H|N(u).
G satisfies both |V (G )| r and 2(G ) br c 3 so G D.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

therefore:
G Kp2 H2 H Kp1 H1 Kp
(8)
As desired.
the proof continues with some technical lemmas to help us prove
that indeed G D implies G Kp2 . The main lemma which is
needed here is as follows:
Lemma
Let G be a graph of order n with (G )
n+m
2
for some

m+3
non-negative integer m n 3. Then there are at least
k
k subsets of G each dominating all but some b2k nc vertices of
G.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

The main theorem is stated as follows:
Theorem
Let r = r (p) be a function of p such that r is an integer and such
that there is an integer k satisfying both r (p 3)l k 5 and
k

b2 r c
br c (p 3)l
(p 3)
<
(9)
k
k
, where l = k + 2blog2 kc + 1. Then c(p) r (p). In particular
p
p
c(p) p log2 p(1 + o(1)) 2.68p log2 p
(10)
for large p.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

In order to prove the theorem we only need to to show that if
G r then G kp2 for the defined r .
During the proof using the stated lemma subgraphs X1 , ..., Xp2 of
G are found such that
Each subgraph is of order at most l
All of them are connected
Each Xj dominates all but at most b2k r c vertices of
G (X1 ... Xj1 )
If i 6= j there is an edge between Xi and Xj
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
So contracting each Xi to a vertex yields a Kp2 minor.

The second part is done via some calculations and we have the
final result which is
p
p
(11)
c(p) p log2 p(1 + o(1)) 2.68p log2 p
for large p.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
K2,t minor free graphs sketch of proof
Our main theorem here is stated below:

K2,t minor. Then
1
|E (G )| (t + 1)(n 1)
2
.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
Fix t 2 and suppose the theorem is false for that value of t. So

there is a minimal counterexample, that is, a graph G with the
following properties:
G has no K2,t minor.
|E (G )| > 12 (t + 1)(|V (G )| 1).
|E (G 0 )| > 21 (t + 1)(|V (G 0 )| 1) for every graph G with no
K2,t minor and |V (G 0 )| < |V (G )|.
Since |E (G )| > 12 (t + 1)(n 1) it follows that n t + 2.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
The proof is technical and so long but the approach is outlined

here:
Proving some basic lemmas about G containing connectivity.
Discovering some facts about size of neighbour set of little
subsets.
Small t cases are handled.
An edge is found with large neighbourhood.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

The proof is long and technical but some major lemmas are listed
below:
Lemma
For every edge xy of G there are at least 12 t xy joins and
consequently every vertex has degree at least 21 t.
Lemma
For every two non adjacent vertices x, x 0 there are at least 3
xx 0 joins, and so G is 3-connected.
Lemma
For every vertex v of G there are at least two vertices non adjacent
to v .
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

Lemma
G is 5-connected and so t 6.
Lemma
Let W V (G ) be connected with |W | 2. If t 11 then
|N(W )| t + 3.
Lemma
Let W V (G ) be connected with |W | 2. Then
|N(W )| t + 3, and if t 13 then |N(w )| t + 2
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

then in a series of deductions an edge is found where the size of
its neighbour set contradicts the bound in last lemma:
Let w be a vertex of maximum degree t + s. Let A = N(w ) and
B = M(w ). Let e1 be the number of edges between A and B and
e2 the number of edged with both end in B. Let (B) be the
number of components of B and A0 be the set of vertices in A
with no neighbour in B. Let X be the set of all vertices in A with
degree t + 1. Let d = 2 if t 13 and d = 3 otherwise.
Now we will complete the proof with deducing a contradiction in
14 steps.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
K2,t minor free graphs sketch of proof I

1
Every vertex in A has at most 4 s neighbours in B, and at

most 3 s if t 13.
Every vertex in B has at least max(3, 12 t + s 2) neighbours
in A, and at least max(3, 21 t + s 1) if t 13.
Every vertex in A has at most t s neighbours in A.
s 2.
If s = 2, then t 14 and e2 1 and |B| 3.
If s = 2 then |B| = 2.
s = 1, and therefore every vertex in G has degree at most

t + 1, and t |B| 1.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
K2,t minor free graphs sketch of proof II

8
|A0 | + (B) 3, and for every component of B, at most t 2

vertices in A have neighbours in C .
|X | + e1 + 2e2 (t + 1)|B| + 1, and |X | + |A0 | t + 1 and so

2e2 (t + 1)(|B| d 1) + (d + 1)|A0 | + 1
10
|B| 5, and if t 13 then |B| 4.
11
|B| 4.
12
|B| 3.
13
there is a dominating edge.
14
At most two vertices in A have more than one neighbour in B.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
K2,t minor free graphs sketch of proof III

Then it is shown that B is isomorphic to K3 .
By (8) and (14) we have:
e1 t + 2 and |A0 | 3.
(12)
(t + 1 |A0 |) + e1 + 2e2 (t + 1)|B| + 1.
(13)
(t 2) + (t + 2) + 6 3(t + 1) + 1.
(14)
By (9) we have
And so
Which is t 2, and it is a contradiction. So we have our desired
result:
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
K2,t minor free graphs sketch of proof IV

K2,t minor. Then
1
|E (G )| (t + 1)(n 1)
2
.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
Ks,t minor free graphs sketch of proof

be the
The main theorem in this section is stated below. Let Ks,t
graph obtained form Ks,t by adding all edges between the vertices
of partite set of size S.

t > t0 (s) := max{415s
2 +2
, (240s log2 (s))8s log2 s+1 }
-minor
Bahman Ghandchi
Graph Minor Theory
(15)

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

Kostochka and Prince previously proved the following theorem:
Theorem
Let t 6500. Then every (3 + t)chromatic graph has a
minor and every (2 + t)chromatic graph has a K minor.
K3,t
2,t
Proof is by induction on s. suppose that the theorem is proved for
all s 0 < s and t > t0 (s 0 ). It is enough to consider s 4.
Let G0 be a counter example for s and some t > t0 (s) which is
minimal with respect to |V (G )| + |E (G )|.
Here is a list of important lemmas and theorems which are used in
proving this theorem:
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

Theorem (1)
Let s,t be positive integers with t > (240s log2 s)8s log2 s+1 . Then
every graph with average degree at least t + 3s has a Ks,t minor,
and there are graphs with average degree at least t + 3s 5 s

that do not have a Ks,t minor.
Lemma (2)
Let s, t be positive integers such that t > t0 (s). Let G be a
15s 2 connected graph. Suppose that G contains a vertex subset
U with:
t + 700s 3 ln t |U| 3t,
(16)
minor.
such that (G |U) t/(4s + 1). Then G has a Ks,t
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

Lemma (3)
n0 2(s + t) 1
Lemma (4 Seymour)
Let k be a non negative integer. If v V (G0 ) and
d(v ) = s + t 1 + k, then (G0 [N(v )]) k + 1
Lemma (5)
Let k be a non negative integer. If v V (G0 ) and
d(v ) = s + t 1S+ k, then there exists a subset Y (v ) N(v ) such
t
that (G0 [Y (v ) {v }]) k+1
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

Lemma (6)
If t 4x+s , then the connectivity of G0 is greater than x.
By theorem 5 we have
v V (G0 ) d(v ) < (t + 3s)(n0 s + 1).
(17)
Let L be the set of vertices of G0 with degree less than t + 5s 1.

so we have:
|L|(t + s 1) + (n0 |L|)(t + 5s) < (t + 3s)(n0 s + 1). (18)
which is
|L|
2s
s 1
n0 +
t.
4s + 1
4s + 1
Bahman Ghandchi
Graph Minor Theory
(19)

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t

2
Since t > 415s +s and by lemma 6, G0 is 15s 2 connected.

By lemma 3 we have n0 2t + 2s 1.
If n0 3t, then G0 with U = V (G0 ) satisfies in lemma 1 and
minor which is contradiction so:
contains a Ks,t
n0 3t + 1.
(20)
6
2
20
3t + t = t.
13
13
13
(21)
Thus for s 3 we have:

|L|
Using lemma 5 we find a subset U that together with G0 satisfies

minor which is contradiction.
in lemma 1 so G0 has a Ks,t
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
Kt
K2,t
Ks,t
So as desired we have the result:

t > t0 (s) := max{415s
2 +2
, (240s log2 (s))8s log2 s+1 }
-minor
Bahman Ghandchi
Graph Minor Theory
(22)

Other approaches
Sketch of proofs
references I
M. Chudnovsky, B. Reed, and P. Seymour.
The edge-density for k2,t minors.
Journal of Combinatorial Theory, Series B, 101(1):18 46,
2011.
K. Kawarabayashi and B. Mohar.
Some recent progress and applications in graph minor theory.
Graphs Combin, 23, 2007.
A. Kostochka and N. Prince.
On ks,t minors in graphs of given average degree.
Discrete Math., (308):44354445, 2008.
Bahman Ghandchi
Graph Minor Theory

Other approaches
Sketch of proofs
references II
A. Kostochka and N. Prince.

On ks,t minors in (s+t)-chromatic graphs.
Journal of Graph Theory, (65):343350, 2010.
A. Thomason.
The extremal function for complete minors.
J. Combin. Theory Ser. B, (81):318338, 2001.
Bahman Ghandchi
Graph Minor Theory

Graph Minor Theory

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Graph Minor Theory

Caricato da

Copyright:

Formati disponibili

Basic concepts and Definitions

Achievements and remarkable works