High Quality
Open the downloaded document, and select print from the file menu (PDF reader required).
AMS 301 Spring 2010: Homework #2
Chao Xu
Supplement II
4
K
n
has
n
2
edges.
102
<
50
<
112
. The least number of vertices is 11.
1.3
6
Isomorphic graph have same amount of edges. Thus
G
and¯
G
has the same amount of edges.
G
have half of the edge of
K
n
.
G
have
n
(
n
−
1)4
edges.
8
Consider only one conference. There are 13 teams play 11 times with each other. The sum of degrees are143, which is not a even number. It is not possible for such play.
1.4
3
(f)
It can be shown that
{
d,a,h
}
and
{
i,f,c
}
creates
K
3
,
3
Where
j,b,e,g
lies between (
a,i
)
,
(
a,c
)
,
(
d,f
)
,
(
f,h
)respectively.
(j)
It can be shown that
{
f,a,c
}
and
{
b,d,g
}
creates
K
3
,
3
.
4
acbedgf h
7
(f)
e
= 4
×
6
/
2 = 12
v
= 4
r
= 10A connected planar graph must stastify
e
≤
3
v
−
61
Add a Comment
Chao Xuleft a comment
uploaded a new revision for this document (#2)
uploaded a new revision for this document (#1)