JCT
2008
14 years 24 days ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
JCT
2008
14 years 24 days ago
2008
: We prove that a small blocking set of PG(2, q) is "very close" to be a linear blocking set over some subfield GF(pe) < GF(q). This implies that (i) a similar result ...
JCT
2008
14 years 24 days ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
JCT
2008
14 years 24 days ago
2008
JCT
2008
14 years 24 days ago
2008
JCT
2008
14 years 24 days ago
2008
Chv
JCT
2008
14 years 24 days ago
2008
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,...
JCT
2008
14 years 24 days ago
2008
JCT
2008
14 years 24 days ago
2008
We show that the topological space of any infinite graph and its ends is normal. In particular, end spaces themselves are normal.
JCT
2008
14 years 24 days ago
2008
