76 search results - page 10 / 16 » jct 2008 |
JCT
2008
14 years 12 months 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 12 months ago
2008
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negati...
112
click to vote
JCT
2008
14 years 12 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
JCT
2008
14 years 12 months ago
2008
A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this note, we prove that if G is a graph such that for each edge xy E...
JCT
2008
14 years 12 months 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 ...